Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1105.5915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min partitioning of grid graphs into connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for max-min partitioning of ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity after path removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Maximally Balanced Connected Partition Problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-separating paths in 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weaker version of Lovász' path removal conjecture / 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: Max-Min Tree Partitioning / rank
 
Normal rank

Latest revision as of 02:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
scientific article

    Statements

    Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (English)
    0 references
    0 references
    2 December 2013
    0 references
    approximation algorithm
    0 references
    non-separating path
    0 references
    balanced connected partition
    0 references
    grid graphs
    0 references

    Identifiers

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