On exact complexity of subgraph homeomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4484 LNCS, Issue , 2007, Pages 256-261

  Lingas, Andrzej ^a   Wahlen, Martin ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MAPPING; PATTERN RECOGNITION; PROBLEM SOLVING;

HOMEOMORPHISM PROBLEM; INJECTIVE MAPPING; VERTEX-DISJOINT PATHS;

GRAPH THEORY;

EID: 35448973245     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72504-6_23     Document Type: Conference Paper

References (13)

1. E.T. Bax. Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters 47(4), pp. 203-207, 1993.
2. A. Björklund and T. Husfeldt. Inclusion-exclusion algorithms for set partitions. Proc. 47th IEEE Symposium on Foundations of Computer Science, Berkeley 2006, pp. 575-582.
3. A. Björklund, T. Husfeldt, P. Kaski and M. Koivisto. Fourier meets Möbius: Fast Subset Convolution. arXiv, 2006, to appear in proc. STOC'07.
4. A. Czumaj and A. Lingas. Finding a heaviest triangle is not harder than matrix multiplication. Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA '07), 2007.
5. R.G. Downey and M.R. Fellows. Parametrized Complexity. Springer, 1999, New York.
6. 0.228n Independent Set Algorithm. Proceedings SODA 2006.
7. M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York 2003.
8. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science, 164, pp. 287-298, 1996.
9. M. Held and R. Karp. A dynamic programming approach to sequencing problems. Journal of SIAM 10, pp. 196-210.
10. R.M. Karp. Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters 1(2), pp. 49-51, 1982.
11. n) algorithm for graph coloring and other partitioning problems via inclusion exclusion. Proc. 47th IEEE Symposium on Foundations of Computer Science, Berkeley 2006, pp. 582-590.
12. J. Matoušek and R. Thomas. On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics, 108, pp. 343-364, 1992.
13. N. Robertson and P.D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combinatorial Theory, Ser. B., Vol. 63 (1995) pp. 65-110.