6740 search results - page 213 / 1348 » An s -Hamiltonian Line Graph Problem |
MST
2010
13 years 5 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
ICDAR
2003
IEEE
14 years 4 months ago
2003
IEEE
Collinear arrangement of objects (such as, text elements or continuous lines) is integral part of any office document image, whether structured or unstructured. The ability to ana...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
DAM
2007
13 years 10 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
SWAT
1998
Springer
14 years 3 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...