Augmenting the connectivity of geometric graphs (Q929747): Difference between revisions

@@ Property / author @@
-Manuel Abellanas
@@ Property / author: Manuel Abellanas / rank @@
-Normal rank
@@ Property / author @@
-Alfredo Daniel Garcia
@@ Property / author: Alfredo Daniel Garcia / rank @@
-Normal rank
@@ Property / author @@
-Q627535
@@ Property / author: Q627535 / rank @@
-Normal rank
@@ Property / author @@
+Manuel Abellanas
@@ Property / author: Manuel Abellanas / rank @@
+Normal rank
@@ Property / author @@
+Alfredo Daniel Garcia
@@ Property / author: Alfredo Daniel Garcia / rank @@
+Normal rank
@@ Property / author @@
+F. Javier Tejel
@@ Property / author: F. Javier Tejel / rank @@
+Normal rank
@@ 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.1016/j.comgeo.2007.09.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2063013286
@@ Property / OpenAlex ID: W2063013286 / rank @@
+Normal rank
@@ Property / cites work @@
+Every set of disjoint line segments admits a binary tree
+Normal rank
@@ Property / cites work @@
+Competitive online routing in geometric graphs
@@ Property / cites work: Competitive online routing in geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Successive edge-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Q5427478
@@ Property / cites work: Q5427478 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250191
@@ Property / cites work: Q4250191 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating paths through disjoint line segments
@@ Property / cites work: Alternating paths through disjoint line segments / rank @@
+Normal rank
@@ Property / cites work @@
+Pointed and colored binary encompassing trees
@@ Property / cites work: Pointed and colored binary encompassing trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230328
@@ Property / cites work: Q4230328 / rank @@
+Normal rank
@@ Property / cites work @@
+Encompassing colored planar straight line graphs
@@ Property / cites work: Encompassing colored planar straight line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independence free graphs and vertex connectivity augmentation
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs
@@ Property / cites work: Augmenting Outerplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
+Normal rank
@@ Property / cites work @@
+Computing Simple Circuits from a Set of Line Segments is NP-Complete
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+A smallest augmentation to 3-connect a graph
@@ Property / cites work: A smallest augmentation to 3-connect a graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:929747