330 search results - page 21 / 66 » Compressing Bounded Degree Graphs |
197
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
185
click to vote
WAOA
2007
Springer
16 years 15 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
171
click to vote
VMV
2004
15 years 7 months ago
2004
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...
146
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
174
click to vote
WDAG
2000
Springer
15 years 10 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...