Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-010-0150-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008738806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic grooming on the path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs are kernel solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for multicut and integral multiflow in rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal multicut and maximal integer multiflow: a survey / 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: College Admissions and the Stability of Marriage / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage assignment for unequal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of irreflexive relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank

Latest revision as of 06:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
scientific article

    Statements

    Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    DE graph
    0 references
    directed tree
    0 references
    intersection graph
    0 references
    kernel
    0 references
    minimum clique cover
    0 references
    multicut
    0 references
    0 references