Pages that link to "Item:Q5321709"
From MaRDI portal
The following pages link to Pathwidth is NP-Hard for Weighted Trees (Q5321709):
Displaying 7 items.
- Connected graph searching (Q690489) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
