Pages that link to "Item:Q3143737"
From MaRDI portal
The following pages link to Centdian Computation in Cactus Graphs (Q3143737):
Displaying 10 items.
- Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- A note on locating a central vertex of a 3-cactus graph (Q913638) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- A combinatorial algorithm for the ordered 1-median problem on cactus graphs (Q2329555) (← links)
- Spanning cactus: complexity and extensions (Q2410246) (← links)
- The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- Centdian Computation for Sensor Networks (Q3569075) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)