Pages that link to "Item:Q2672632"
From MaRDI portal
The following pages link to A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632):
Displaying 4 items.
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- A note proving the nullity of block graphs is unbounded (Q6646411) (← links)