A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7047706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parameterized algorithmics framework for degree sequence completion problems in directed graphs |
scientific article; zbMATH DE number 7047706 |
Statements
A parameterized algorithmics framework for degree sequence completion problems in directed graphs (English)
0 references
25 April 2019
0 references
NP-hard graph problem
0 references
graph realizability
0 references
\(k\)-anonymity
0 references
graph modification
0 references
arc insertion
0 references
fixed-parameter tractability
0 references
kernelization
0 references
0.9990183115005492
0 references
0.7538789510726929
0 references
0.7485363483428955
0 references
