5473 search results - page 248 / 1095 » On the graph isomorphism problem |
271
click to vote
ALGORITHMICA
2011
15 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
172
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
188
click to vote
FOCS
2005
IEEE
16 years 27 days ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
163
click to vote
COCO
2004
Springer
16 years 20 days ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
207
click to vote
CIDM
2009
IEEE
15 years 11 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...