×

Found 40 Documents (Results 1–40)

On the number of labeled graphs of bounded treewidth. (English) Zbl 1486.05292

Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 88-99 (2017).
MSC:  05C85 05C05 05C30
PDFBibTeX XMLCite
Full Text: DOI arXiv

A linear algorithm for finding total colorings of partial \(k\)-trees. (English) Zbl 0955.05096

Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 347-356 (1999).
PDFBibTeX XMLCite

Multicoloring planar graphs and partial \(k\)-trees. (English) Zbl 0945.05027

Hochbaum, Dorit (ed.) et al., Randomization, approximation, and combinatorial optimization. Algorithms and techniques. 3rd international workshop on randomization and approximation techniques in computer science, and 2nd international workshop on approximation algorithms for combinatorial optimization problems RANDOM-APPROX ’99. Berkeley, CA, USA, August 8-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1671, 73-84 (1999).
MSC:  05C15
PDFBibTeX XMLCite

The generalized matching problem on partial \(k\)-trees. (English) Zbl 0931.05080

Graham, Ronald L. (ed.) et al., Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 143-158 (1999).
MSC:  05C85 03B15 90C39 05C70 68R10
PDFBibTeX XMLCite

A polynomial-time algorithm for finding total colorings of partial \(k\)-trees. (English) Zbl 0915.05059

Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 100-113 (1998).
PDFBibTeX XMLCite

Vertex partitioning problems on partial \(k\)-trees. (English) Zbl 0886.05106

Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3-5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 161-172 (1996).
MSC:  05C85 68R10 68Q25 05C05 05C70 03B15
PDFBibTeX XMLCite
Full Text: DOI

Polynomial time algorithms for recursive graph classes. (English) Zbl 0765.05085

Combinatorics, graph theory, and computing, Proc. 22nd Southeast Conf., Baton Rouge/LA (USA) 1991, Congr. Numerantium 85, 219-234 (1991).
MSC:  05C85 68Q25 68R10
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field