×

Found 10 Documents (Results 1–10)

Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast. (English) Zbl 1522.68394

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 19, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Exact algorithms for the maximum planar subgraph problem: new models and experiments. (English) Zbl 1493.68262

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 22, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A note on the practicality of maximal planar subgraph algorithms. (English) Zbl 1478.68225

Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 357-364 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software