Pages that link to "Item:Q5891702"
From MaRDI portal
The following pages link to NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702):
Displayed 7 items.
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Efficiently Realizing Interval Sequences (Q5138976) (← links)
- (Q5899483) (redirect page) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
