×

Found 259 Documents (Results 1–100)

100
MathJax

Bears with hats and independence polynomials. (English) Zbl 07538584

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 283-295 (2021).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI

Mixing of Markov chains for independent sets on chordal graphs with bounded separators. (English) Zbl 07336143

Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 664-676 (2020).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI

Burning two worlds. (English) Zbl 1440.68190

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 113-124 (2020).
PDF BibTeX XML Cite
Full Text: DOI

On the iterated edge-biclique operator. (English) Zbl 07515213

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 577-587 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

Tuple domination on graphs with the consecutive-zeros property. (English) Zbl 07515198

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 401-411 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

Families of induced trees and their intersection graphs. (English) Zbl 07515186

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 265-274 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

On the tractability of optimization problems on \(H\)-graphs. (English) Zbl 07378700

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 30, 14 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Contraction-bidimensionality of geometric intersection graphs. (English) Zbl 1448.05048

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 5, 13 p. (2018).
MSC:  05C10 05C75
PDF BibTeX XML Cite
Full Text: DOI

On the recognition of neighborhood inclusion posets. (English) Zbl 1383.05051

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 285-290 (2017).
MSC:  05C05 06A07 68Q25
PDF BibTeX XML Cite
Full Text: DOI

The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity. (English) Zbl 1383.05273

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 261-266 (2017).
MSC:  05C76 05C15
PDF BibTeX XML Cite
Full Text: DOI

Intersection graphs of orthodox paths in trees. (English) Zbl 1383.05269

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 99-104 (2017).
MSC:  05C76 05C10 05C85
PDF BibTeX XML Cite
Full Text: DOI

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

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).
PDF BibTeX XML Cite
Full Text: DOI

A refined analysis of online path coloring in trees. (English) Zbl 1484.68338

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 142-154 (2017).
PDF BibTeX XML Cite
Full Text: DOI

A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. (English) Zbl 1417.05215

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 138-153 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

10-tough chordal graphs are Hamiltonian (extended abstract). (English) Zbl 1346.05152

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 331-336, electronic only (2015).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification