Constructing Brambles

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

Volumn 5734 LNCS, Issue , 2009, Pages 223-234

  Chapelle, Mathieu ^a   Mazoit, Frédéric ^b   Todinca, Ioan ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ARBITRARY GRAPHS; COMBINATORICS; INPUT GRAPHS; POLYNOMIAL NUMBER; POLYNOMIAL-TIME; RUNNING TIME; RUNNING-IN; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 70349336968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_20     Document Type: Conference Paper

References (22)

1. Amini, O., Mazoit, F., Thomassé, S., Nisse, N.: Partition Submodular Functions. To appear in Disc. Math. (2008), http://www.lirmm.fr/ thomasse/liste/partsub.pdf
2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of Finding Embeddings in a k-Tree. SIAM J. on Algebraic and Discrete Methods 8, 277-284 (1987)
3. Bachoore, E.H., Bodlaender, H.L.: New Upper Bound Heuristics for Treewidth. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.3503, pp. 216-227. Springer, Heidelberg (2005)
4. Bellenbaum, P., Diestel, R.: Two Short Proofs Concerning Tree-Decompositions. Combinatorics, Probability & Computing 11(6) (2002)
5. Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25, 1305-1317 (1996)
6. Bodlaender, H.L.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209(1-2), 1-45 (1998)
7. Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth Lower Bounds with Brambles. Algorithmica 51(1), 81-98 (2008)
8. Bodlaender, H.L., Koster, A.M.C.A.: On the Maximum Cardinality Search Lower Bound for Treewidth. Disc. App. Math. 155(11), 1348-1372 (2007)
9. Bodlaender, H.L., Wolle, T., Koster, A.M.C.A.: Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1), 5-49 (2006)
10. Bouchitté, V., Todinca, I.: Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput. 31(1), 212-232 (2001)
11. Bouchitté, V., Todinca, I.: Listing All Potential Maximal Cliques of a Graph. Theor. Comput. Sci. 276(1-2), 17-32 (2002)
12. Chapelle, M., Mazoit, F., Todinca, I.: Constructing Brambles. Technical Report, LIFO, Université d'Orléans (2009)
13. Clautiaux, F., Carlier, J., Moukrim, A., Nègre, S.: New Lower and Upper Bounds for Graph Treewidth. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.2647, pp. 70-80. Springer, Heidelberg (2003)
14. Fomin, F.V., Fraigniaud, P., Nisse, N.: Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3), 358-373 (2009)
15. Fomin, F.V., Kratsch, D., Todinca, I., Villanger, Y.: Exact Algorithms for Treewidth and Minimum Fill-in. SIAM J. Comput. 38(3), 1058-1079 (2008)
16. Fomin, F.V., Thilikos, D.M.: An Annotated Bibliography on Guaranteed Graph Searching. Theor. Comput. Sci. 399(3), 236-245 (2008)
17. Grohe, M., Marx, D.: On Tree Width, Bramble Size, and Expansion. J. Comb. Theory, Ser. B 99(1), 218-228 (2009)
18. Lyaudet, L., Mazoit, F., Thomassé, S.: Partitions Versus Sets: A Case of Duality (submitted 2009), http://www.lirmm.fr/thomasse/liste/dualite.pdf
19. Mazoit, F.: Décompositions Algorithmiques des Graphes. PhD thesis, école Nor-male Supérieure de Lyon (2004) (in French)
20. Mazoit, F.: The Branch-width of Circular-Arc Graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.3887, pp. 727-736. Springer, Heidelberg (2006)
21. Robertson, N., Seymour, P.D.: Graph Minors X. Obstructions to Tree Decompositions. J. Comb. Theory, Ser. B 52, 153-190 (1991)
22. Seymour, P.D., Thomas, R.: Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory, Ser. B 58(1), 22-33 (1993)