From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Enumeration and maximum number of maximal irredundant sets for chordal graphs.

P. Golovach, D. Kratsch, M. Liedloff, и M. Sayadi. Discret. Appl. Math., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Dieter Kratsch

Dieter Kratsch

Dieter Kratsch

Christina Kratsch

Dietrich Kratsch

Другие публикации лиц с тем же именем

Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph.T. Kloks, и D. Kratsch. Inf. Process. Lett., 55 (1): 11-16 (1995)Enumerating minimal dominating sets in chordal bipartite graphs.P. Golovach, P. Heggernes, M. Kanté, D. Kratsch, и Y. Villanger. Discret. Appl. Math., (2016)Minimal dominating sets in interval graphs and trees.P. Golovach, P. Heggernes, M. Kanté, D. Kratsch, и Y. Villanger. Discret. Appl. Math., (2017)1-Tough cocomparability graphs are hamiltonian.J. Deogun, D. Kratsch, и G. Steiner. Discret. Math., 170 (1-3): 99-106 (1997)Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs.P. Golovach, P. Heggernes, and D. Kratsch. IWOCA, volume 9538 of Lecture Notes in Computer Science, page 235-247. Springer, (2015)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.P. Golovach, P. Heggernes, M. Kanté, D. Kratsch, S. Sæther, and Y. Villanger. ISAAC, volume 9472 of Lecture Notes in Computer Science, page 248-258. Springer, (2015)Convex Recoloring Revisited: Complexity and Exact Algorithms.I. Kanj, and D. Kratsch. COCOON, volume 5609 of Lecture Notes in Computer Science, page 388-397. Springer, (2009)Exact Algorithms for Graph Homomorphisms.F. Fomin, P. Heggernes, and D. Kratsch. FCT, volume 3623 of Lecture Notes in Computer Science, page 161-171. Springer, (2005)Exact (Exponential) Algorithms for the Dominating Set Problem.F. Fomin, D. Kratsch, and G. Woeginger. WG, volume 3353 of Lecture Notes in Computer Science, page 245-256. Springer, (2004)Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.P. Golovach, P. Heggernes, D. Kratsch, P. Lima, and D. Paulusma. WG, volume 10520 of Lecture Notes in Computer Science, page 275-288. Springer, (2017)