5473 search results - page 122 / 1095 » On the graph isomorphism problem |
174
click to vote
ACSD
2005
IEEE
16 years 15 days ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
150
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
245
click to vote
FOCS
2005
IEEE
16 years 15 days ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
178
click to vote
ISSAC
2005
Springer
16 years 11 days ago
2005
Springer
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
162
click to vote
DM
2008
15 years 7 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...