Shortcutting directed and undirected networks with a degree constraint

DOI10.1016/j.dam.2016.12.016zbMath1355.05235MaRDI QIDQ507583

Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen

Publication date: 6 February 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/350789

zbMATH Keywords

networks; diameter; stability number; compression; NP-hardness; DAGs; \(W[2\)-hardness]; feedback dimension; path covers; rooted directed trees; shortcutting

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C38: Paths and cycles

05C12: Distance in graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)