An improved algorithm for finding cycles through elements

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

Volumn 5035 LNCS, Issue , 2008, Pages 374-384

  Kawarabayashi, Ken Ichi ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MICROFLUIDICS; NONLINEAR PROGRAMMING; OPTIMIZATION; PAPER; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SCHEDULING ALGORITHMS;

IMPROVED ALGORITHM; INDEPENDENT EDGES; INTERNATIONAL CONFERENCES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS;

INTEGER PROGRAMMING;

EID: 45749094623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_26     Document Type: Conference Paper

References (34)

1. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11-24 (1989)
2. Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)
3. Bodlaender, H.L.: A linear-time algorithm for finding tree-decomposition of small treewidth. SIAM J. Comput. 25, 1305-1317 (1996)
4. Bondy, J.A., Lovász, L.: Cycles thourhg specified vertices of a graph. Combinator-ica 1, 117-140 (1981)
5. Demaine, E.D., Fomin, F., Hajiaghayi, M., Thilikos, D.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52, 1-29 (2005)
6. Diestel, R., Gorbunov, K.Y., Jensen, T.R., Thomassen, C.: Highly connected sets and the excluded grid theorem. J. Combin. Theory Ser. B 75, 61-73 (1999)
7. Dirac, G.A.: In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre unterteilungen. Math. Nachr. 22, 61-85 (1960)
8. Erdos, P.L., Gyori, E.: Any four independent edges of a 4-connected graph are contained in a circuit. Acta Math. Hungar. 46, 311-313 (1985)
9. Gabow, H.: Finding paths and cycles of superpolylogarithmic lentgh. In: STOC 2004, Chicago, Illinois, USA, pp. 407-416 (2004)
10. Häggkvist, R., Thomassen, C.: Circuits through specified edges. Discrete Math. 41, 29-34 (1982)
11. Holton, D.A., McKay, B.D., Plummer, M.D., Thomassen, C.: A nine point theorem for 3-connected graphs. Combinatorica 2, 53-62 (1982)
12. Ibaraki, T., Nagamichi, H.: A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583-596 (1992)
13. Johnson, D.: The Many Faces of Polynomial Time. J. Algorithms 8, 285-303 (1987)
14. Kawarabayashi, K.: One or two disjoint ciruits cover independent edges, Loväsz-Woodall Conjecture. J. Combin. Theory Ser. B. 84, 1-44 (2002)
15. Kawarabayashi, K.: Two circuits through independent edges (manuscript, 1999)
16. Kawarabayashi, K.: An extremal problem for two circuits through independent edges (manuscript, 1999)
17. Kawarabayashi, K.: Proof of Lovász-Woodall Conjecture (in preparation)
18. Kawarabayashi, K.: Cycles through prescribed vertex set in N-connected graphs. J. Combin. Theory Ser. B 90, 315-323 (2004)
19. Kleinberg, J.: Decision algorithms for unsplittable flows and the half-disjoint paths problem. In: Proc. 30th ACM Symposium on Theory of Computing, pp. 530-539 (1998)
20. LaPaugh, A.S., Rivest, R.L.: The subgraph homomorphism problem. J. Comput. Sys. Sci. 20, 133-149 (1980)
21. Lomonosov, M.V.: Cycles through prescribed elements in a graph. In: Korte, Lovász, Promel, Schrijver (eds.) Paths, Flows, and VLSI Layout, pp. 215-234. Springer, Berlin (1990)
22. Lovász, L.: Problem 5. Period. Math. Hungar, 82 (1974)
23. Lovász, L.: Exercise 6.67. In: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)
24. Perkovic, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. International Journal on the Foundations of Computing Science 11, 81-85 (2000)
25. Reed, B.: Tree width and tangles: a new connectivity measure and some applications. In: Surveys in Combinatorics, London. London Math. Soc. Lecture Note Ser., vol. 241, pp. 87-162. Cambridge Univ.Press, Cambridge (1997)
26. Reed, B.: Rooted Routing in the Plane. Discrete Applied Mathematics 57, 213-227 (1995)
27. Reed, B., Robertson, N., Schrijver, A., Seymour, P.D.: Finding disjoint trees in planar graphs in linear time. In: Graph structure theory (Seattle, WA, 1991) Contemp. Math., pp. 295-301. Amer. Math. Soc., Providence (1993)
28. Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Com-bin. Theory Ser. B 41, 92-114 (1986)
29. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63, 65-110 (1995)
30. Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89, 43-76 (2003)
31. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323-348 (1994)
32. Sanders, D.P.: On circuits through five edges. Discrete Math. 159, 199-215 (1996)
33. Thomassen, C.: Note on circuits containing specified edges. J. Combin. Theory Ser. B. 22, 279-280 (1977)
34. Woodall, D.R.: Circuits containing specified edges. J. Combin. Theory Ser. B. 22, 274-278 (1977)