Planar Graph Algorithms is a class of graph algorithms specifically designed to solve computational problems on planar graphs, which are graphs that can be embedded in the plane without edge crossings, leveraging their topological properties to achieve efficiency or correctness guarantees not generally attainable on non-planar graphs.
1.2K
Publications
66.2K
Citations
1.5K
Authors
620
Institutions
Publications per year
2017–2026
76
Parents
Publications
1.2K
A Separator Theorem for Planar Graphs
Richard J. Lipton, Robert E. Tarjan · SIAM Journal on Applied Mathematics · 1979 · 1.4K citations
Choice Reviews Online · 1995 · 1.3K citations
1–5 of 1.2K
Authors
1.5K
- GD
18
h-index
- PN
17
h-index
- ARAndré Raspaud
Laboratoire Bordelais de Recherche en Informatique, France
18 publications · 656 citations
16
h-index
- TN
16
h-index
- RE
15
h-index
1–5 of 1.5K
Institutions
620
Brown University
Providence, United States
21 h-index
45 publications
2.7K citations
Centre National de la Recherche Scientifique
Paris, France
19 h-index
63 publications
1.7K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
19 h-index
58 publications
1.9K citations
Université de Bordeaux
Bordeaux, France
19 h-index
57 publications
1.8K citations
Zhejiang Normal University
Jinhua, China
18 h-index
84 publications
1.7K citations
Institut Polytechnique de Bordeaux
Bordeaux, France
18 h-index
38 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
18 h-index
24 publications
1.4K citations
University of Waterloo
Waterloo, Canada
18 h-index
41 publications
997 citations
1–8 of 620
Venues
- SIAM Journal on Computing
60 publications · 9.5K citations
40
h-index
- Journal of Combinatorial Theory Series B
60 publications · 4.8K citations
30
h-index
- Discrete Mathematics
83 publications · 2.6K citations
28
h-index
- Algorithmica
46 publications · 2.1K citations
25
h-index
- Journal of Graph Algorithms and Applications
JGAA · 51 publications · 2K citations
24
h-index
1–5