×

Found 4 Documents (Results 1–4)

Near-optimum universal graphs for graphs with bounded degrees (extended abstract). (English) Zbl 1001.05086

Goemans, Michel (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approximation techniques in computer science, RANDOM 2001, Berkeley, CA, USA, August 18-20, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2129, 170-180 (2001).
MSC:  05C60 05D40
PDFBibTeX XMLCite
Full Text: Link

An algorithmic embedding of graphs via perfect matchings. (English) Zbl 0927.05074

Luby, Michael (ed.) et al., Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM ’98. Barcelona, Spain, October 8–10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1518, 25-34 (1998).
MSC:  05C85 05C70 05C10
PDFBibTeX XMLCite

Filter Results by …

Document Type

Year of Publication

Main Field