A plane graph representation of triconnected graphs (Q410724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.tcs.2010.08.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019713299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional Routing via Generalized <i>st</i>-Numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic and adaptive memory procedure for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane triangulations are 6-partitionable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant routings in a \(\kappa\)-connected network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most uniform path partitioning and its use in image processing / 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: A robust algorithm for bisecting a triconnected graph with two resource sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for bipartition of biconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:46, 5 July 2024

scientific article
Language Label Description Also known as
English
A plane graph representation of triconnected graphs
scientific article

    Statements

    A plane graph representation of triconnected graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2012
    0 references
    algorithms
    0 references
    connectivity
    0 references
    plane graphs
    0 references
    graph embedding
    0 references
    data structure
    0 references
    independent trees
    0 references
    partition
    0 references

    Identifiers

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