×

Found 11 Documents (Results 1–11)

Parameterized aspects of strong subgraph closure. (English) Zbl 1442.68169

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 23, 13 p. (2018).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Linear-time generation of random chordal graphs. (English) Zbl 1486.68138

Fotakis, Dimitris (ed.) et al., Algorithms and complexity. 10th international conference, CIAC 2017, Athens, Greece, May 24–26, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10236, 442-453 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Maximal induced matchings in triangle-free graphs. (English) Zbl 1417.05159

Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 93-104 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Contracting graphs to paths and trees. (English) Zbl 1310.68228

Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 55-66 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software