×

Found 4 Documents (Results 1–4)

On approximating the \(d\)-girth of a graph. (English) Zbl 1298.68297

Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 467-481 (2011).
MSC:  68W25 05C35 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Degree-constrained subgraph problems: Hardness and approximation results. (English) Zbl 1209.68629

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 29-42 (2009).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Year of Publication

Main Field