×

Found 44 Documents (Results 1–44)

Well-quasi orders and hierarchy theory. (English) Zbl 1496.03189

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 271-319 (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Spanning distribution trees of graphs (extended abstract). (English) Zbl 1303.90118

Fellows, Michael (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Third joint international conference, FAW-AAIM 2013, Dalian, China, June 26–28, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38755-5/pbk). Lecture Notes in Computer Science 7924, 153-162 (2013).
PDF BibTeX XML Cite
Full Text: DOI

On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree. (English) Zbl 1260.68169

Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 146-155 (2012).
PDF BibTeX XML Cite
Full Text: DOI

Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract). (English) Zbl 1304.05139

Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14–16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 117-128 (2012).
MSC:  05C85 05C15 05C78
PDF BibTeX XML Cite
Full Text: DOI

Efficient pattern matching on graph patterns of bounded treewidth. (English) Zbl 1268.05217

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 117-122 (2011).
MSC:  05C85
PDF BibTeX XML Cite
Full Text: DOI

Weighted coloring: Further complexity and approximability results. (English) Zbl 1171.68611

Coppo, Mario (ed.) et al., Theoretical computer science. 9th Italian conference, ICTCS 2005, Siena, Italy, October 12–14, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29106-7/pbk). Lecture Notes in Computer Science 3701, 205-214 (2005).
PDF BibTeX XML Cite
Full Text: DOI

Generalized vertex-rankings of partial \(k\)-trees. (Extended abstract). (English) Zbl 0883.05118

Jiang, Tao (ed.) et al., Computing and combinatorics. 3rd annual international conference, COCOON ’97. Shanghai, China. August 20–22, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1276, 212-221 (1997).
Reviewer: H.Müller (Jena)
PDF BibTeX XML Cite

Graph reductions, and techniques for finding minimal forbidden minors. (English) Zbl 0787.05032

Robertson, Neil (ed.) et al., Graph structure theory. Proceedings of the AMS-IMS-SIAM joint summer research conference on graph minors held June 22 to July 5, 1991 at the University of Washington, Seattle, WA (USA). Providence, RI: American Mathematical Society. Contemp. Math. 147, 591-600 (1993).
MSC:  05C10 05C75
PDF BibTeX XML Cite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software