6740 search results - page 328 / 1348 » An s -Hamiltonian Line Graph Problem |
166
click to vote
FAST
2009
15 years 2 months ago
2009
The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. In this paper, we argue that named graphs alone can...
151
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
213
click to vote
ALGORITHMICA
2011
14 years 11 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...
124
click to vote
ISAAC
2009
Springer
15 years 10 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...
132
click to vote
FOCS
2005
IEEE
15 years 10 months 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...