Unsolved algorithmic problems on trees
From MaRDI portal
Publication:2508406
zbMath1104.05056MaRDI QIDQ2508406
Publication date: 12 October 2006
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
matchingindependent setNP-completeannihilationdominationirredundancebroadcast numberinfluence numberperfect neighbourhood
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Weighted restrained domination in subclasses of planar graphs ⋮ Algorithmic aspects of broadcast independence ⋮ Exponential independence ⋮ Broadcasts on paths and cycles ⋮ Relating domination, exponential domination, and porous exponential domination ⋮ On the broadcast independence number of caterpillars
This page was built for publication: Unsolved algorithmic problems on trees
