×

Found 165 Documents (Results 1–100)

A better upper bound on the bisection width of de Bruijn networks (extended abstract). (English) Zbl 1498.68203

Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 511-522 (1997).
MSC:  68R10 05C70
PDFBibTeX XMLCite
Full Text: DOI

LP based approach to optimal stable matchings. (English) Zbl 1321.90084

Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms, SODA ’97, New Orleans, LA, January 5–7, 1997. Philadelphia, PA: SIAM; New York, NY: ACM (ISBN 0-89871-390-0). 710-719 (1997).
MSC:  90C05 05C70 05C85
PDFBibTeX XMLCite

Fast approximate graph partitioning algorithms. (English) Zbl 1321.05259

Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms, SODA ’97, New Orleans, LA, January 5–7, 1997. Philadelphia, PA: SIAM; New York, NY: ACM (ISBN 0-89871-390-0). 639-648 (1997).
PDFBibTeX XMLCite

Determinant algorithms for random planar structures. (English) Zbl 1321.68323

Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms, SODA ’97, New Orleans, LA, January 5–7, 1997. Philadelphia, PA: SIAM; New York, NY: ACM (ISBN 0-89871-390-0). 258-267 (1997).
PDFBibTeX XMLCite

Algebraic structure count and Kekulé structure count of hexagonal-square chains. (English) Zbl 0942.05051

Herceg, D. (ed.) et al., PRIM ’96. Proceedings of the XI conference on applied mathematics, Budva, Yugoslavia, June 3-6, 1996. Novi Sad: Univ. of Novi Sad, Fac. of Science, Inst. of Math. 9-20 (1997).
MSC:  05C70
PDFBibTeX XMLCite

Graph classes between parity and distance-hereditary graphs. (English) Zbl 0912.05052

Bridges, D. S. (ed.) et al., Combinatorics, complexity, and logic. Proceedings of the 1st international conference on discrete mathematics and theoretical computer science, DMTCS ’96, Auckland, New Zealand, December 9–13, 1996. Berlin: Springer. 168-181 (1997).
MSC:  05C70 05C75 05C60
PDFBibTeX XMLCite

Complexity of colored graph covers. I: Colored directed multigraphs. (English) Zbl 0890.68095

Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18–20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 242-257 (1997).
MSC:  68R10 05C15 05C70
PDFBibTeX XMLCite

Compuational complexity of the Krausz dimension of graphs. (English) Zbl 0890.68094

Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18–20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 214-228 (1997).
MSC:  68R10 05C35 05C70
PDFBibTeX XMLCite

All-cavity maximum matchings. (English) Zbl 0892.05043

Leong, Hon Wai (ed.) et al., Algorithms and computation. 8th international symposium, ISAAC ’97, Singapore, December 17–19, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1350, 364-373 (1997).
PDFBibTeX XMLCite

Delone graphs; some species and local rules. (English) Zbl 0881.05034

Moody, Robert V. (ed.), The mathematics of long-range aperiodic order. Proceedings of the NATO Advanced Study Institute, Waterloo, Ontario, Canada, August 21–September 1, 1995. Dordrecht: Kluwer Academic Publishers. NATO ASI Ser., Ser. C, Math. Phys. Sci. 489, 85-114 (1997).
MSC:  05B45 05C99 52C22
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 3

Main Field

Software