On the complexity of directed intersection representation of DAGs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1696521
- On the intractability landscape of digraph intersection representations
- Directed Intersection Representations and the Information Content of Digraphs
- DAGmaps and \(\varepsilon \)-visibility representations for DAGs: algorithms and characterizations
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Space complexity of the directed reachability problem over surface-embedded graphs
- The dag-width of directed graphs
- DAGmaps and \(\varepsilon \)-visibility representations of DAGs
- Dynamic complexity of directed reachability and other problems
- On the complexity of recognizing directed path families
Cites work
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- A digraph represented by a family of boxes or spheres
- Connection digraphs and second-order line digraphs
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Data reduction and exact algorithms for clique cover
- Interval digraphs: An analogue of interval graphs
- On the hardness of approximating minimization problems
- The Representation of a Graph by Set Intersections
Cited in
(2)
This page was built for publication: On the complexity of directed intersection representation of DAGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019504)
