An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-010-9481-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068751619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractible edges in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Vertex Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic orthogonal segment intersection search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on contractible edges in graphs of a prescribed vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rubber bands, convex embeddings and graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on Certifying Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new graph triconnectivity algorithm and its parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction Sequences and Certifying 3-Connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank

Latest revision as of 03:38, 5 July 2024

scientific article
Language Label Description Also known as
English
An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs
scientific article

    Statements

    An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    certifying algorithms
    0 references
    triconnectivity
    0 references
    Hamiltonian graph
    0 references
    0 references