Pages that link to "Item:Q1254104"
From MaRDI portal
The following pages link to Linear algorithms on recursive representations of trees (Q1254104):
Displaying 13 items.
- Generalized power domination of graphs (Q444434) (← links)
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) (← links)
- An algorithm for the most economic link addition in a tree communications network (Q1259541) (← links)
- Nearly perfect sets in graphs (Q1842165) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Profiles of random trees: correlation and width of random recursive trees and binary search trees (Q5694147) (← links)