A V log V algorithm for isomorphism of triconnected planar graphs (Q2264677): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-0000(73)80013-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089527381 / rank
 
Normal rank

Latest revision as of 08:48, 30 July 2024

scientific article
Language Label Description Also known as
English
A V log V algorithm for isomorphism of triconnected planar graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references