6740 search results - page 381 / 1348 » An s -Hamiltonian Line Graph Problem |
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
101
click to vote
IPL
2006
15 years 4 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
141
click to vote
JCO
2007
15 years 4 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
140
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
167
click to vote
DC
2010
15 years 4 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...