6740 search results - page 41 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
200
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
136
click to vote
WG
1993
Springer
15 years 7 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
137
click to vote
JGAA
2008
15 years 3 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
161
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...