6740 search results - page 22 / 1348 » An s -Hamiltonian Line Graph Problem |
SPIRE
2001
Springer
14 years 1 days ago
2001
Springer
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
DEXAW
2009
IEEE
14 years 2 months ago
2009
IEEE
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
MVA
1994
13 years 9 months ago
1994
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...