Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
From MaRDI portal
(Redirected from Publication:548676)
Recommendations
- Coloring all directed paths in a symmetric tree, with an application to optical networks
- scientific article; zbMATH DE number 3912430
- Colouring paths in directed symmetric trees with applications to WDM routing
- The \(k\)-edge intersection graphs of paths in a tree
- scientific article; zbMATH DE number 4116559
Cites work
- scientific article; zbMATH DE number 1862254 (Why is no real title available?)
- A greedy algorithm for multicut and integral multiflow in rooted trees
- College Admissions and the Stability of Marriage
- Combinatorial optimization in geometry
- Decomposition by clique separators
- Fractional kernels in digraphs
- Geometric algorithms and combinatorial optimization
- Intersection graphs of paths in a tree
- Minimal multicut and maximal integer multiflow: a survey
- Normal hypergraphs and the perfect graph conjecture
- On the complexity of the parity argument and other inefficient proofs of existence
- Optimal wavelength routing on directed fiber trees
- Perfect graphs are kernel solvable
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Solutions of irreflexive relations
- Stable marriage assignment for unequal sets
- Traffic grooming on the path
Cited in
(3)
This page was built for publication: Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548676)
