An analysis of heuristics for graph planarization (Q4354090): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02522667.1997.10699312
+Normal rank
@@ Property / OpenAlex ID @@
+W2000695501
@@ Property / OpenAlex ID: W2000695501 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
+Normal rank
@@ Property / cites work @@
+An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Graph theory applications
@@ Property / cites work: Graph theory applications / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient graph planarization two‐phase heuristic
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Alpha-algorithms for incremental planarity testing (preliminary version)
+Normal rank