A V log V algorithm for isomorphism of triconnected planar graphs (Q2264677): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5670175 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A V log V algorithm for isomorphism of triconnected planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs / rank | |||
Normal rank |
Revision as of 12:52, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A V log V algorithm for isomorphism of triconnected planar graphs |
scientific article |
Statements
A V log V algorithm for isomorphism of triconnected planar graphs (English)
0 references
1973
0 references