Characterization of graphs and digraphs with small process numbers (Q2275910): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / OpenAlex ID
 
Property / OpenAlex ID: W2152871123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs and digraphs with small process numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of reroute sequence planning problem in MPLS networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstruction set isolation for the gate matrix layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rerouting tunnels for MPLS network resource optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear algorithms for cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:52, 4 July 2024

scientific article
Language Label Description Also known as
English
Characterization of graphs and digraphs with small process numbers
scientific article

    Statements

    Characterization of graphs and digraphs with small process numbers (English)
    0 references
    0 references
    0 references
    10 August 2011
    0 references
    rerouting
    0 references
    process number
    0 references
    vertex separation
    0 references
    pathwidth
    0 references

    Identifiers