Pages that link to "Item:Q1011721"
From MaRDI portal
The following pages link to On the OBDD size for graphs of bounded tree- and clique-width (Q1011721):
Displaying 10 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348) (← links)
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width (Q5405029) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711546) (← links)