3008 search results - page 183 / 602 » Independence in connected graphs |
171
click to vote
ALENEX
2007
15 years 8 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
163
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
170
click to vote
ACL
2007
15 years 8 months ago
2007
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
227
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
152
click to vote
DM
2010
15 years 6 months ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...