MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Edge-Contraction Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Some Approximation Results for the Maximum Agreement Forest Problem
by E. M. Rodrigues, M-f. Sagot, Y. Wakabayashi — 2001 — Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (APPROX and RANDOM 2001
… agree, after performing some forced edge contractions. This problem is known to be NP…
Cited by 4 (0 self) – Add To MetaCart

On the maximum common embedded subtree problem for ordered trees
by Antoni Lozano, Gabriel Valiente — 2004 — In C. Iliopoulos and T Lecroq, editors, String Algorithmics, chapter 7. King’s College London Publications
… formulated as a node deletion rather than an edge contraction problem. One of the main application areas…
Cited by 2 (0 self) – Add To MetaCart

Isoperimetric Inequalities and the Width Parameters of Graphs?
by L. Sunil Ch, Ran T. Kavitha, C. R. Subramanian
… sequence of edge contractions). This problem has received some attention in the literature. It can…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB