×

Found 13 Documents (Results 1–13)

Extending partial representations of interval graphs. (English) Zbl 1331.68107

Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 276-285 (2011).
MSC:  68Q25 05C62 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the complexity of reconstructing \(H\)-free graphs from their star systems. (English) Zbl 1136.68459

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 194-205 (2008).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of generalized domination: A complete dichotomy for chordal graphs. (English) Zbl 1141.68530

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 1-11 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Complexity of graph covering problems. (English) Zbl 1528.68306

Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 93-105 (1995).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software