Strong-mixed searching and pathwidth
From MaRDI portal
Publication:867027
DOI10.1007/s10878-006-9013-9zbMath1112.90039MaRDI QIDQ867027
Publication date: 14 February 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9013-9
Related Items
Lower bounds for positive semidefinite zero forcing and their applications, An annotated bibliography on guaranteed graph searching, Zero-visibility cops and robber and the pathwidth of a graph, Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
Cites Work