Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0607043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046904788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flow algorithms for series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on the Complexity of the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kth paths and p-centers by generating and searching good data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact labelling scheme for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:42, 17 June 2024

scientific article
Language Label Description Also known as
English
Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
scientific article

    Statements

    Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    graph decomposition
    0 references
    selection algorithms
    0 references
    uncapacitated plant location
    0 references
    biconnected series-parallel multigraphs
    0 references
    binary decomposition tree
    0 references
    single source shortest path problem
    0 references
    0 references