On the complexity of edge labelings for trees

DOI10.1016/0304-3975(82)90011-1zbMath0478.68069OpenAlexW2046380856MaRDI QIDQ1161294

S. Singh

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027/uiuo.ark:/13960/t1bk2xb0f

zbMATH Keywords

NP-completeoptimization problempolynomial-time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Some notes on bounded starwidth graphs ⋮ Optimal edge ranking of trees in polynomial time ⋮ Computing Prüfer codes efficiently in parallel ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On the computational power of pushdown automata
• Optimum Communication Spanning Trees
• The complexity of the network design problem

This page was built for publication: On the complexity of edge labelings for trees