Pages that link to "Item:Q896003"
From MaRDI portal
The following pages link to Are there any good digraph width measures? (Q896003):
Displaying 15 items.
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- (Q5090497) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Directed ear anonymity (Q6547947) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
