×

Found 36 Documents (Results 1–36)

Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness. (English) Zbl 1493.68398

D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 14, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Drawing clustered graphs as topographic maps. (English) Zbl 1377.68178

Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 426-438 (2013).
MSC:  68R10 05C82 68U05
PDFBibTeX XMLCite
Full Text: DOI

The Open Graph Archive: a community-driven effort. (English) Zbl 1311.68102

van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 435-440 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Single-source shortest paths with the parallel boost graph library. (English) Zbl 1209.05239

Demetrescu, Camil (ed.) et al., The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13–14, 2006. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4383-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 74, 219-248 (2009).
MSC:  05C85 05C35 90C35
PDFBibTeX XMLCite

Combining two structured domains for modeling various graph matching problems. (English) Zbl 1162.68652

Fages, François (ed.) et al., Recent advances in constraints. 12th annual ERCIM international workshop on constraint solving and constraint logic programming, CSCLP 2007, Rocquencourt, France, June 7–8, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89811-5/pbk). Lecture Notes in Computer Science 5129. Lecture Notes in Artificial Intelligence, 76-90 (2008).
MSC:  68T20 68R10
PDFBibTeX XMLCite
Full Text: DOI

A new exact algorithm for the two-sided crossing minimization problem. (English) Zbl 1175.05129

Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 301-310 (2007).
MSC:  05C85 05C10 90C57
PDFBibTeX XMLCite
Full Text: DOI

Minimal spanning set for coverage testing of interactive systems. (English) Zbl 1108.68417

Liu, Zhiming (ed.) et al., Theoretical aspects of computing – ICTAC 2004. First international colloquium, Guiyang, China, September 20–24, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-25304-1/pbk). Lecture Notes in Computer Science 3407, 220-234 (2005).
MSC:  68N99 68R10
PDFBibTeX XMLCite
Full Text: DOI

Two new heuristics for two-sided bipartite graph drawing. (English) Zbl 1037.68594

Goodrich, Michael T. (ed.) et al., Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26–28, 2002. Revised papers. Berlin: Springer (ISBN 3-540-00158-1/pbk). Lect. Notes Comput. Sci. 2528, 312-319 (2002).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: Link

The directed minimum-degree spanning tree problem. (English) Zbl 1052.68642

Hariharan, Ramesh (ed.) et al., FST TCS 2001: Foundations of software technology and theoretical computer science. 21st conference, Bangalore, India, December 13–15, 2001. Proceedings. Berlin: Springer (ISBN 3-540-43002-4). Lect. Notes Comput. Sci. 2245, 232-243 (2001).
MSC:  68R10 68W25
PDFBibTeX XMLCite
Full Text: Link

A new approximation algorithm for the planar augmentation problem. (English) Zbl 0929.68082

Proceedings of the 9th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 25–27, 1998. Philadelphia, PA: SIAM. 260-269 (1998).
MSC:  68R10
PDFBibTeX XMLCite

A parallelization of Dijkstra’s shortest path algorithm. (English) Zbl 0912.05056

Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 722-731 (1998).
MSC:  05C85 05C80 68R10
PDFBibTeX XMLCite

The Stanford GraphBase: A platform for combinatorial algorithms. (English) Zbl 0806.68121

Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 41-43 (1993).
Reviewer: D.E.Knuth
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software