6740 search results - page 165 / 1348 » An s -Hamiltonian Line Graph Problem |
140
Voted
COCOA
2009
Springer
15 years 7 months ago
2009
Springer
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
122
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
139
click to vote
SPIRE
2000
Springer
15 years 6 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
137
click to vote
MST
2011
14 years 10 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
113
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...