MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Subgraph Homeomorphism Problem." – sorted by Relevance.

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

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

11 documents found, showing 1 through 10. Next 10 →

ATOM

Lattice Embedding
by J. J. Sarbo, Janos J. Sarbo — 1996 — Conceptual Structures: Knowledge Representation as Interlingua (ICCS'96), volume 1115 of Springer-Verlag
… isomorphism, (sub)graph homomorphism and (sub)graph homeomorphism, as a preliminary to our problem. We develop…
Cited by 3 (2 self) – Add To MetaCart

A shape analysis model with applications to a character recognition system
by Jairo Rocha, The Pavlidis — 1994 — IEEE Trans. Pattern Analysis and Machine Intelligence
… prototype. The subgraph homeomorphism problem is NP-complete even if the graphs involved are connected…
Cited by 24 (1 self) – Add To MetaCart

The NP-completeness column: an ongoing guide
by David S. Johnson — 1985 — Journal of Algorithms
… resolved problem is SUBGRAPH HOMEOMORPHISM (FOR A FIXED GRAPH H); Robertson and Seymour show…
Cited by 154 (0 self) – Add To MetaCart

The Complexity of Constraints on Intervals and Lengths
by Andrei Krokhin, Peter Jeavons, Peter Jonsson — 2002 — In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS-2002
… Subgraph Homeomorphism problem [25]. Constraint satisfaction problems have been a fruitful source…
Cited by 1 (1 self) – Add To MetaCart

Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
by Shuichi Ichikawa, Hidemitsu Saito, Lerdtanaseangtham Udorn, Kouji Konishi — 2000 — In: Proc. 10th Int’l Conf. Field-Programmable Logic and Applications (FPL2000). LNCS1896
… computational technique and is applicable to subgraph homeomorphism problems. However, no more detailed…
Cited by 2 (2 self) – Add To MetaCart

The Complexity of Minimal Satisfiability Problems
by Lefteris M. Kirousis, Phokion G. Kolaitis — 2001
… for the class of Fixed Subgraph Homeomorphism problems on directed graphs, obtained by Fortune, Hopcroft…
Cited by 12 (2 self) – Add To MetaCart

Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary
by Peter Jonsson — 2000 — Theoretical Computer Science
… of computational problems have been given by, for instance, Fortune et al. [3] (the subgraph homeomorphism problem…
Cited by 6 (4 self) – Add To MetaCart

survivable
by unknown authors — 2007
…,j)∈G′ wij. The survivable network design problem (SND), seeks a minimum weight subgraph of G such that each…
Add To MetaCart

Finding large cycles in hamiltonian graphs
by Rajeev Motwani — 2005 — In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA’05
… subgraph homeomorphism problem, but with unreasonably large constants even for our case of triangles…
Cited by 6 (2 self) – Add To MetaCart

Speeding up Dynamic Programming for Some NP-hard Graph Recoloring Problems
by Oriana Ponta, Falk Hüffner, Rolf Niedermeier
… [13] recently presented an application in the context of subgraph homeomorphism problems. 3 Proc. 5th…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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