Efficient Algorithms for Petersen's Matching Theorem (1999)

by Therese C. Biedl , Prosenjit Bose , Erik D. Demaine , Anna Lubiw
Citations:24 - 3 self

Documents Related by Co-Citation

24 On Triangulating Planar Graphs under the Four-Connectivity Constraint – T. Biedl, G. Kant, M. Kaufmann - 1995
11 Two Algorithms for Finding Rectangular Duals of Planar Graphs – Goos Kant, Xin He - 1992
12 An Algorithm for Finding A rectangular dual of a planar graph for use in area planning for VLSI integrated circuits – K Kozminski, E Kinnen - 1984
8 All Separating Triangles in a Plane Graph Can Be Optimally “Broken – A Accornero, M Ancona, S Varini
48 Die theorie der regulären graphs – Julius Petersen
43 Near-optimal fully-dynamic graph connectivity. Proc. 32nd Ann – M Thorup
141 An o(sqrt(v)e) algorithm for finding maximum matching in general graphs – S Micali, V V Vazirani - 1980
5 On Floorplans of Planar Graphs – X He - 1997
12 Algorithms for floorplan design via rectangular dualization – Y-T Lai, S M Leinwand - 1988
72 Arboricity and subgraph listing algorithms – N Chiba, T Nishizeki
7 Trees with Convex Faces and Optimal Angles – Josiah Carlson - 2006
5 S.: Euclidean Representation of 3D electronic institutions: Automatic Generation – Anton Bogdanovych, Sara Drago - 2006
10 A methodology for 3D electronic institutions – Anton Bogdanovych, Marc Esteva, Simeon J Simoff, Carles Sierra, Helmut Berger
65 Hamiltonian Triangulations for Fast Rendering – Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven S. Skiena - 1994
30 A linear algorithm to find a rectangular dual of a planar triangulated graph – J Bhasker, S Sahni - 1988
34 On the angular resolution of planar graphs – S Malitz, A Papakostas - 1994
24 Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) – Ashim Garg, Roberto Tamassia - 1994
22 Planar Polyline Drawings with Good Angular Resolution – Carsten Gutwenger, Petra Mutzel - 1998
70 A short proof of Chvátal’s watchman theorem – S Fisk - 1978