Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient routing in optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized path coloring on binary trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of path coloring and call scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal wavelength routing on directed fiber trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring paths in directed symmetric trees with applications to WDM routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient routing in all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Coloring the Lines of a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250199 / rank
 
Normal rank

Latest revision as of 13:30, 24 June 2024

scientific article
Language Label Description Also known as
English
Path problems in generalized stars, complete graphs, and brick wall graphs
scientific article

    Statements

    Path problems in generalized stars, complete graphs, and brick wall graphs (English)
    0 references
    28 April 2006
    0 references
    0 references
    Path coloring
    0 references
    Maximum path coloring
    0 references
    Edge-disjoint paths
    0 references
    Approximation algorithm
    0 references
    Min-cost flow
    0 references
    0 references