Pages that link to "Item:Q2422741"
From MaRDI portal
The following pages link to A polynomial algorithm for weighted scattering number in interval graphs (Q2422741):
Displaying 6 items.
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Computing the weighted isolated scattering number of interval graphs in polynomial time (Q2325144) (← links)
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time (Q6087804) (← links)