Gopalakrishnan Sundaram, Steven S. Skiena  Home/Search
Context Related
| sunysb.edu/~skiena/paper...subgraphs.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunysb.edu/~skiena/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Although the general problem of subgraph isomorphism is NP-complete, polynomialtime algorithms exist for recognizing any fixed subgraph. However, certain subgraphs appear easier to recognize than others. In this paper, we present general algorithms for fixed-subgraph isomorphism which improve or unify previous results. In particular, we present an O(n m) algorithm for recognizing a fixed subgraph H with flower number f within a graph G with n vertices and m edges. Special cases of this... (Update)
Context of citations to this paper: More
...counting method used here yields, in particular, a way of finding C k s for k 7, in O(V ) worst case time. Sundaram and Skiena [14] have recently presented some more fixed subgraph isomorphism algorithms. The results presented here, and in [1] and [15] improve some of...
Cited by: More
Finding and Counting Given Length Cycles - Alon, Yuster, Zwick (1995) (Correct)
Active bibliography (related documents): More All
0.6: Approximate Counting of Given Length Cycles - Dorgerloh, Wirtgen (1997) (Correct)
0.6: Once again: Finding simple cycles in graphs - Dorgerloh, Wirtgen (1997) (Correct)
0.5: Practical Toroidality Testing - Neufeld, Myrvold (1996) (Correct)
Similar documents based on text: More All
0.5: Data Dependent Circuit for Subgraph Isomorphism Problem - Ichikawa, Yamamoto (2002) (Correct)
0.4: A Partial Digest Approach to Restriction Site Mapping - Skiena, Sundaram (1993) (Correct)
0.4: Reconstructing Strings from Substrings - Skiena, Sundaram (1993) (Correct)
BibTeX entry: (Update)
G. Sundaram and S.S. Skiena. Recognizing small subgraphs. Networks, 1995. To appear. http://citeseer.ist.psu.edu/sundaram95recognizing.html More
@article{ sundaram95recognizing,
author = "Sundaram and Skiena",
title = "Recognizing Small Subgraphs",
journal = "NETWORKS: Networks: An International Journal",
volume = "25",
year = "1995",
url = "citeseer.ist.psu.edu/sundaram95recognizing.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
143 Algorithmic aspects of tree-width (context) - Robertson, Seymour - 1986
89 A linear recognition algorithm for cographs (context) - Corniel, Perl et al. - 1985
41 Arboricity and subgraph listing algorithms (context) - Chiba, Nishizeki - 1985
31 An algorithm for subgraph isomorphism (context) - Ullman - 1976
24 Cycles of even lengths in graphs (context) - Bondy, Simonovits - 1974
20 Finding a minimum circuit in a graph (context) - Itai, Rodeh - 1978
15 How to find long paths efficiently (context) - Monien - 1985
11 The complexity of restricted spanning tree problems (context) - Papadimitriou, Yannakakis - 1982
10 On maximal paths and circuits of graphs (context) - Erdos, Gallai - 1959
8 On linear time minor tests and depth first search - Bodlaender - 1989
6 Polynomial-time self reducibility: Theoretical motivations a.. (context) - Brown, Fellows et al. - 1989
6 Finding minimally weighted subgraphs (context) - Plehn, Voigt - 1990
6 the complexity of the subgraph problem (context) - Nesetril, Poljak - 1985
5 and subgraph multiplicity (context) - Eppstein, graph - 1992
5 Finding cycles of a given length (context) - Richards, Liestman - 1985
3 Finding short cycles in planar graphs using seperators (context) - Richards - 1986
2 Graph minors XVI (context) - Robertson, Seymour
1 st ACM Symp (context) - Fellows, Langston et al. - 1989
Documents on the same site (http://www.cs.sunysb.edu/~skiena/papers/): More
Optimizing RNA Secondary Structure Over All Possible Encodings .. - Cohen, Skiena (2000) (Correct)
Exploiting Genetic Code Redundancy to Optimize RNA Secondary.. - Cohen, Skiena (2000) (Correct)
Combinatorial Dominance Guarantees for Heuristic Algorithms.. - Berend, Skiena (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC