Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Linear Time Algorithm
Planar Graph
Related Publications
(22)
A V² Algorithm for Determining Isomorphism of Planar Graphs
Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time
Isomorphism of planar graphs (working paper)
The design and analysis of computer algorithms
Isomorphism of Bounded Valence Can Be Tested in Polynomial Time
Subscribe
Academic
Publications
A linear time algorithm for isomorphism of planar graphs
A linear time algorithm for isomorphism of planar graphs,J. Hopcroft,J. Wong
Edit
A linear time algorithm for isomorphism of planar graphs
(
Citations: 140
)
BibTex

RIS

RefWorks
Download
J. Hopcroft
,
J. Wong
Conference:
ACM Symposium on Theory of Computing  STOC
, 1974
Cumulative
Annual
Citation Context
(74)
...graph G is the representative among rooted graphs with the same plane graphs or not by computing its signature [
1
]...
Bingbing Zhuang
,
et al.
Generating Internally Triconnected Rooted Plane Graphs
...rooted graph G is the representative among rooted graphs with the same plane graphs or not by computing its signature [
2
]...
Bingbing Zhuang
,
et al.
Listing Triconnected Rooted Plane Graphs
...Polynomial time isomorphism tests are known for many natural classes of graphs, for example, planar graphs [16], [
17
] and graphs embeddable in a fixed surface [18], [19], graphs of bounded tree width [20], graphs with excluded minors [21], and graphs of bounded degree [22]...
Martin Grohe
.
FixedPoint Definability and Polynomial Time on Graphs with Excluded M...
...Polynomial time canonisation mappings are known for many natural classes of graphs, for example planar graphs [40,
41
], graphs of bounded genus [25, 51], graphs of bounded eigenvalue multiplicity [3], graphs of bounded degree [4, 50], and graphs of bounded tree width [8]...
Martin Grohe
.
FixedPoint Definability and Polynomial Time on Chordal Graphs and Lin...
...Furthermore, this running time has been shown for the parameter genus [13, 23] (extending polynomialtime algorithms for planar graphs [
18
, 27]) and, more general, for the size of an excluded minor [24]...
Stefan Kratsch
,
et al.
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
Sort by:
Citations
(140)
Generating Internally Triconnected Rooted Plane Graphs
(
Citations: 2
)
Bingbing Zhuang
,
Hiroshi Nagamochi
Conference:
Theory and Applications of Models of Computation  TAMC
, pp. 467478, 2010
Listing Triconnected Rooted Plane Graphs
(
Citations: 2
)
Bingbing Zhuang
,
Hiroshi Nagamochi
Conference:
Conference on Combinatorial Optimization and Applications  COCOA
, pp. 347361, 2010
FixedPoint Definability and Polynomial Time on Graphs with Excluded Minors
(
Citations: 4
)
Martin Grohe
Conference:
Logic in Computer Science  LICS
, pp. 179188, 2010
FixedPoint Definability and Polynomial Time on Chordal Graphs and Line Graphs
(
Citations: 3
)
Martin Grohe
Journal:
Computing Research Repository  CORR
, vol. abs/1001.2, pp. 328353, 2010
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
(
Citations: 3
)
Stefan Kratsch
,
Pascal Schweitzer
Conference:
Scandinavian Workshop on Algorithm Theory  SWAT
, pp. 8192, 2010