×

Found 21 Documents (Results 1–21)

A tight extremal bound on the Lovász cactus number in planar graphs. (English) Zbl 07559128

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 19, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Finding triangles for maximum planar subgraphs. (English) Zbl 1485.68310

Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 373-384 (2017).
MSC:  68W25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI

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

Limits of greedy approximation algorithms for the maximum planar subgraph problem. (English) Zbl 1478.68224

Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 334-346 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Planarization and acyclic colorings of subcubic claw-free graphs. (English) Zbl 1341.05068

Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 107-118 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a \(\frac 34\)-approximation for finding maximum planar induced subgraphs. (English) Zbl 1075.05602

Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 121-126 (2004).
MSC:  05C85 68W25
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software