Pages that link to "Item:Q2392245"
From MaRDI portal
The following pages link to The rank-width of edge-coloured graphs (Q2392245):
Displaying 18 items.
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Directed NLC-width (Q906393) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
