Pages that link to "Item:Q1119661"
From MaRDI portal
The following pages link to Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661):
Displaying 14 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Efficient graph representations (Q1396949) (← links)
- Multiaspect graphs: algebraic representation and algorithms (Q1662581) (← links)
- On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- The representation of multi-hypergraphs by set intersections (Q3504808) (← links)
- (Q3838411) (← links)
- Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph (Q4909563) (← links)
- Directed Intersection Representations and the Information Content of Digraphs (Q5151714) (← links)
- Difference graphs (Q5907056) (← links)
- Hyperideal-based intersection graphs (Q6099744) (← links)