2009/01/01 by Piotr Berman, Marek Karpiński, Marek Karpinski +2 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Artificial intelligence #Binary tree #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Enhanced Data Rates for GSM Evolution #Gomory–Hu tree #Graph #K-ary tree #Mathematics #Minimum spanning tree #Spanning tree #Steiner tree problem #Tree (set theory) #Tree structure #VLSI and FPGA Design Techniques #Vertex (graph theory) #Vertex connectivity #k-minimum spanning tree
paper · doi:10.1007/978-3-642-03367-4_8
crossref issued 2009/01/01 · crossref published 2009/01/01 · crossref published-print 2009/01/01 · openalex publication_date 2009/01/01 · crossref created 2009/07/20 · crossref deposited 2019/03/09 · openalex created_date 2025/10/10 · crossref indexed 2026/02/01 · openalex updated_date 2026/08/04