5473 search results - page 142 / 1095 » On the graph isomorphism problem |
185
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
162
Voted
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The Problem Frames approach captures problems as seen by developers, but not by stakeholders. This paper presents a framework that extends the problem diagram of the Problem Frame...
164
click to vote
WG
2005
Springer
16 years 13 days ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
191
Voted
ICIP
2010
IEEE
15 years 5 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
176
Voted
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...