Pages that link to "Item:Q1575443"
From MaRDI portal
The following pages link to Algorithms for generalized vertex-rankings of partial k-trees (Q1575443):
Displaying 8 items.
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
