Planarity Testing
Planarity Testing is a computational method in graph drawing that determines whether a given graph can be embedded in the plane without edge crossings, distinguishing it from other graph layout techniques by its focus on topological embeddability.
84
Publications
6.2K
Citations
172
Authors
86
Institutions
Publications per year
2017–2026
7
Parents
84
John E. Hopcroft, Robert E. Tarjan · Journal of the ACM · 1974 · 1.1K citations · Full text
Giuseppe Di Battista, Roberto Tamassia · SIAM Journal on Computing · 1996 · 241 citations
1–5 of 84
172
11
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 172
86
University of Perugia
Perugia, Italy
6 h-index
12 publications
303 citations
Roma Tre University
Rome, Italy
6 h-index
14 publications
445 citations

The University of Sydney
Sydney, Australia
4 h-index
6 publications
243 citations
Columbia University
New York, United States
4 h-index
4 publications
126 citations
Brown University
Providence, United States
3 h-index
5 publications
754 citations

Kyoto University
Kyoto, Japan
3 h-index
3 publications
108 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
5 publications
80 citations
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
1.1K citations
1–8 of 86
JGAA · 14 publications · 594 citations
12
h-index
8 publications · 949 citations
8
h-index
5 publications · 159 citations
5
h-index
4 publications · 1.6K citations
4
h-index
JACM · 4 publications · 1.2K citations
4
h-index
1–5