Search results for "Spanning-Tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Yoram Moses, Benny Shimony	A New Proof of the GHS Minimum Spanning Tree Algorithm.	DISC	2006	DBLP DOI BibTeX RDF
23	Daniel A. M. Rocha, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg	A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem.	EvoCOP	2006	DBLP DOI BibTeX RDF
23	Grégoire Dooms, Irit Katriel	The Minimum Spanning Tree Constraint.	CP	2006	DBLP DOI BibTeX RDF
23	Ágnes Vathy-Fogarassy, Attila Kiss 0001, János Abonyi	Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm.	FoIKS	2006	DBLP DOI BibTeX RDF
23	Adrian Ion, Walter G. Kropatsch, Yll Haxhimusa	Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method .	SSPR/SPR	2006	DBLP DOI BibTeX RDF
23	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation
23	Michael J. Laszlo, Sumitra Mukherjee	Minimum Spanning Tree Partitioning Algorithm for Microaggregation.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF
23	Timothy M. Chan	Finding the shortest bottleneck edge in a parametric minimum spanning tree.	SODA	2005	DBLP BibTeX RDF
23	A. S. Nepomniaschaya	Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex.	PaCT	2005	DBLP DOI BibTeX RDF
23	Adrian Kosowski, Lukasz Kuszner	A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves.	PPAM	2005	DBLP DOI BibTeX RDF
23	Lixia Han, Yuping Wang 0003	A Novel Genetic Algorithm for Multi-criteria Minimum Spanning Tree Problem.	CIS (1)	2005	DBLP DOI BibTeX RDF
23	Yoon-Teck Bau, Chin Kuan Ho, Hong Tat Ewe	An Ant Colony Optimization Approach to the Degree-Constrained Minimum Spanning Tree Problem.	CIS (1)	2005	DBLP DOI BibTeX RDF
23	Michael Elkin	A faster distributed protocol for constructing a minimum spanning tree.	SODA	2004	DBLP BibTeX RDF
23	Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter	A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components.	Euro-Par	2004	DBLP DOI BibTeX RDF
23	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
23	Ernesto Tapia, Raúl Rojas 0001	Recognition of On-line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance.	GREC	2003	DBLP DOI BibTeX RDF
23	Ahmed Khedr 0001, Raj Bhatnagar	Decomposable Algorithms for Computing Minimum Spanning Tree.	IWDC	2003	DBLP DOI BibTeX RDF
23	Jun Han 0006, Graham McMahon, Stephen Sugden	A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem.	LCN	2003	DBLP DOI BibTeX RDF
23	Sibylle Peuker	Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm.	ICATPN	2002	DBLP DOI BibTeX RDF
23	Jun Han 0006, Graham McMahon, Stephen Sugden	A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note).	Euro-Par	2002	DBLP DOI BibTeX RDF
23	Bernard Chazelle	A minimum spanning tree algorithm with Inverse-Ackermann type complexity.	J. ACM	2000	DBLP DOI BibTeX RDF	graphs, minimum spanning trees, matroids
23	Enrico Nardelli, Guido Proietti, Peter Widmayer	Maintaining a Minimum Spanning Tree Under Transient Node Failures.	ESA	2000	DBLP DOI BibTeX RDF
23	Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege	Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.	FSTTCS	2000	DBLP DOI BibTeX RDF
23	Sai Ho Kwok, Anthony G. Constantinides	A fast recursive shortest spanning tree for image segmentation and edge detection.	IEEE Trans. Image Process.	1997	DBLP DOI BibTeX RDF
23	Gheorghe Antonoiu, Pradip K. Srimani	Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction.	Euro-Par	1997	DBLP DOI BibTeX RDF
23	Sun Chung, Anne Condon	Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm.	IPPS	1996	DBLP DOI BibTeX RDF
23	Teresa M. Przytycka, Lisa Higham	Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm.	SWAT	1996	DBLP DOI BibTeX RDF
23	Drago Krznaric, Christos Levcopoulos	Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.	FSTTCS	1995	DBLP DOI BibTeX RDF
23	Sudhanshu Aggarwal, Shay Kutten	Time Optimal Self-Stabilizing Spanning Tree Algorithms.	FSTTCS	1993	DBLP DOI BibTeX RDF
23	Neng H. Ching, Dov Rosenfeld, Michael Braun 0001	Two-dimensional phase unwrapping using a minimum spanning tree algorithm.	IEEE Trans. Image Process.	1992	DBLP DOI BibTeX RDF
23	Francis Suraweera, Prabir Bhattacharya	A Parallel Algorithm for the Minimum Spanning Tree on an SIMD Machine.	ACM Conference on Computer Science	1992	DBLP DOI BibTeX RDF
23	Forbes D. Lewis, Nancy K. Van Cleave	Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
23	C. Cheng, I. Arieh Cimet, Srikanta P. R. Kumar	A protocol to maintain a minimum spanning tree in a dynamic topology.	SIGCOMM	1988	DBLP DOI BibTeX RDF
23	Kazuo Iwama, Andrzej Lingas, Masaki Okita	Max-Stretch Reduction for Tree Spanners.	Algorithmica	2008	DBLP DOI BibTeX RDF	Tree spanner, Maximum stretch, Graph augmentation, Time complexity
23	Kazuo Iwama, Andrzej Lingas, Masaki Okita	Max-stretch Reduction for Tree Spanners.	WADS	2005	DBLP DOI BibTeX RDF
23	Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
23	Alexander Zelikovsky, Ion I. Mandoiu	Practical approximation algorithms for zero- and bounded-skew trees.	SODA	2001	DBLP BibTeX RDF
23	Radia J. Perlman	An algorithm for distributed computation of a spanningtree in an extended LAN.	SIGCOMM	1985	DBLP DOI BibTeX RDF
22	Refael Hassin, Jérôme Monnot, Danny Segev	Approximation algorithms and hardness results for labeled connectivity problems.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Labeled connectivity, Approximation algorithms, Hardness of approximation
22	Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001	Parameterized Algorithms for Directed Maximum Leaf Problems.	ICALP	2007	DBLP DOI BibTeX RDF
22	Amaro de Sousa, Gil Soares	Improving Load Balance of Ethernet Carrier Networks Using IEEE 802.1S MSTP with Multiple Regions.	Networking	2006	DBLP DOI BibTeX RDF
22	Huaijun Qiu, Edwin R. Hancock	Graph Matching using Commute Time Spanning Tr.	ICPR (4)	2006	DBLP DOI BibTeX RDF
22	Huaijun Qiu, Edwin R. Hancock	Graph Matching using Commute Time Spanning Trees.	ICPR (3)	2006	DBLP DOI BibTeX RDF
22	Refael Hassin, Jérôme Monnot, Danny Segev	Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.	MFCS	2006	DBLP DOI BibTeX RDF
22	Huaijun Qiu, Edwin R. Hancock	Spanning Trees from the Commute Times of Random Walks on Graphs.	ICIAR (2)	2006	DBLP DOI BibTeX RDF
22	José Carlos Sancho, Antonio Robles, José Duato	An Effective Methodology to Improve the Performance of the Up/Down Routing Algorithm.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF
22	Hanan Luss, Richard T. Wong	Survivable telecommunications network design under different types of failures.	IEEE Trans. Syst. Man Cybern. Part A	2004	DBLP DOI BibTeX RDF
22	Cyril Banino, Olivier Beaumont, Arnaud Legrand, Yves Robert	Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids.	PARA	2002	DBLP DOI BibTeX RDF
22	Mikkel Thorup, David R. Karger	Dynamic Graph Algorithms with Applications.	SWAT	2000	DBLP DOI BibTeX RDF
22	Takeaki Uno	A New Approach for Speeding Up Enumeration Algorithms.	ISAAC	1998	DBLP DOI BibTeX RDF
22	Alpár Jüttner, Ádám Magi	Tree Based Broadcast in Ad Hoc Networks.	Mob. Networks Appl.	2005	DBLP DOI BibTeX RDF	ad-hoc networks, multicast, wireless LANs, broadcast, routing algorithms
22	Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson	Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	multicasting, Data replication, facility location, tree networks, p-medians, file allocation
21	Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees
21	Michael Schuresko, Jorge Cortés 0001	Distributed Tree Rearrangements for Reachability and Robust Connectivity.	HSCC	2009	DBLP DOI BibTeX RDF
21	Thilmee M. Baduge, Kazushi Ikeda, Hirozumi Yamaguchi, Teruo Higashino	Stability Oriented Overlay Multicast for Multimedia Streaming in Multiple Source Context.	ICC	2008	DBLP DOI BibTeX RDF
21	Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz	Multicast Tree Diameter for Dynamic Distributed Interactive Applications.	INFOCOM	2008	DBLP DOI BibTeX RDF
21	Bor-Yiing Su, Yao-Wen Chang, Jiang Hu	An Exact Jumper-Insertion Algorithm for Antenna Violation Avoidance/Fixing Considering Routing Obstacles.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2007	DBLP DOI BibTeX RDF
21	Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan Zhang	Two Tree-Based Algorithms for Network Spare Capacity Design.	PDCAT	2007	DBLP DOI BibTeX RDF
21	Bor-Yiing Su, Yao-Wen Chang, Jiang Hu	An optimal jumper insertion algorithm for antenna avoidance/fixing on general routing trees with obstacles.	ISPD	2006	DBLP DOI BibTeX RDF	jumper insertion, antenna effect
21	Alessandro Ordine, Fabio Feuli, Giuseppe Bianchi 0001	Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks.	CoNEXT	2006	DBLP DOI BibTeX RDF
21	Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim	Embedding Starlike Trees into Hypercube-Like Interconnection Networks.	ISPA Workshops	2006	DBLP DOI BibTeX RDF	restricted HL-graphs, path partition, interconnection networks, Spanning trees
21	Yuval Emek, David Peleg	Approximating Minimum Max-Stretch spanning Trees on unweighted graphs.	SODA	2004	DBLP BibTeX RDF
21	Yau-Ming Sun, Chih-Hsueh Yang, Yeh-Ching Chung, Tai-Yi Huang	An Efficient Deadlock-Free Tree-Based Routing Algorithm for Irregular Wormhole-Routed Networks Based on the Turn Model	ICPP	2004	DBLP DOI BibTeX RDF
21	Gary L. Miller, Peter C. Richter	Lower bounds for graph embeddings and combinatorial preconditioners.	SPAA	2004	DBLP DOI BibTeX RDF	congestion, preconditioning, dilation, graph embeddings
21	Atsuko Yamaguchi, Hiroshi Mamitsuka	Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees.	ISAAC	2003	DBLP DOI BibTeX RDF
21	Jochen Könemann, R. Ravi 0001	Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.	FSTTCS	2003	DBLP DOI BibTeX RDF
21	Sayaka Kamei, Hirotsugu Kakugawa	A Self-Stabilizing Algorithm for the Steiner Tree Problem.	SRDS	2002	DBLP DOI BibTeX RDF
21	Joseph Naor, Baruch Schieber	Improved Approximations for Shallow-Light Spanning Trees.	FOCS	1997	DBLP DOI BibTeX RDF	shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design
21	Vinaya Revannaswamy, P. C. P. Bhatt	A Fault Tolerant Protocol As an Extension to a Distributed Mutual Exclusion Algorithm.	ICPADS	1997	DBLP DOI BibTeX RDF	fault tolerance, distributed algorithms, Computer networks, mutual exclusion, critical section, network partitioning, token passing
21	Ting-Hai Chao, Yu-Chin Hsu	Rectilinear Steiner tree construction by local and global refinement.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
20	Berfin Erdinç, Mahmut Kaya, Ali Senol	MCMSTStream: applying minimum spanning tree to KD-tree-based micro-clusters to define arbitrary-shaped clusters in streaming data.	Neural Comput. Appl.	2024	DBLP DOI BibTeX RDF
20	Ali Senol	MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
20	Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié	A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs.	CoRR	2022	DBLP DOI BibTeX RDF
20	Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié	A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs.	ICPP	2022	DBLP DOI BibTeX RDF
20	Konstantinos Mastakas	Drawing a rooted tree as a rooted y-monotone minimum spanning tree.	Inf. Process. Lett.	2021	DBLP DOI BibTeX RDF
20	Konstantinos Mastakas	Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree.	CoRR	2018	DBLP BibTeX RDF
20	Akio Fujiyoshi	A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata.	Int. J. Found. Comput. Sci.	2017	DBLP DOI BibTeX RDF
20	Sravan Danda, Aditya Challa, B. S. Daya Sagar, Laurent Najman	Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters.	ISMM	2017	DBLP DOI BibTeX RDF
20	Jakob Bossek, Christian Grimme	A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem.	SSCI	2017	DBLP DOI BibTeX RDF
20	Akio Fujiyoshi	A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata.	CIAA	2016	DBLP DOI BibTeX RDF
20	Dongwoo Kwon, Hongtaek Ju	A media distribution tree construction method using a maximum spanning tree for mobile smart devices.	APNOMS	2015	DBLP DOI BibTeX RDF
20	Linchao Bao, Yibing Song, Qingxiong Yang, Hao Yuan, Gang Wang 0012	Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree.	IEEE Trans. Image Process.	2014	DBLP DOI BibTeX RDF
20	Genya Ishigaki, Masao Yoshida, Norihiko Shinomiya	On maximizing tree reliability based on minimum diameter spanning tree.	APCCAS	2014	DBLP DOI BibTeX RDF
20	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer	Drawing a tree as a minimum spanning tree approximation.	J. Comput. Syst. Sci.	2012	DBLP DOI BibTeX RDF
20	Luis Eduardo Neves Gouveia, Luidi Simonetti, Eduardo Uchoa	Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.	Math. Program.	2011	DBLP DOI BibTeX RDF
20	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer	Drawing a Tree as a Minimum Spanning Tree Approximation.	ISAAC (2)	2010	DBLP DOI BibTeX RDF
20	Daniel Raible 0001, Henning Fernau	An Amortized Search Tree Analysis for k-Leaf Spanning Tree.	SOFSEM	2010	DBLP DOI BibTeX RDF
20	David S. Planeta	Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks	CoRR	2007	DBLP BibTeX RDF
20	Gengui Zhou, Zhiqing Meng, Zhenyu Cao, Jian Cao	A New Tree Encoding for the Degree-Constrained Spanning Tree Problem.	CIS	2007	DBLP DOI BibTeX RDF
20	Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin, Mohamed Haouari	Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem.	J. Exp. Theor. Artif. Intell.	2003	DBLP DOI BibTeX RDF
20	Young C. Wee, Seth Chaiken, S. S. Ravi	Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors.	Algorithmica	1994	DBLP DOI BibTeX RDF
20	Ying Teh Tsai, Chuan Yi Tang	The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
20	Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong	Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree.	ICCAD	1989	DBLP DOI BibTeX RDF
20	Petr Kovár, Michael Kubesa	Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees.	IWOCA	2009	DBLP DOI BibTeX RDF
20	Franz Rothlauf, Carsten Tzschoppe	Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator.	EvoCOP	2005	DBLP DOI BibTeX RDF
20	Xiang-Yang Li 0001, Yu Wang 0003	Efficient Construction of Low Weight Bounded Degree Planar Spanner.	COCOON	2003	DBLP DOI BibTeX RDF
20	Yuh-Shyan Chen, Tong-Ying Juang, Ying-Ying Shen	Multi-Node Broadcasting in an Arrangement Graph Using Multiple Spanning Trees.	ICPADS	2000	DBLP DOI BibTeX RDF	routing, parallel processing, interconnection network, broadcast, Arrangement graph
19	Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis	A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees.	SSS	2009	DBLP DOI BibTeX RDF
19	Byoungyong Lee, Kyungseo Park, Ramez Elmasri	Reducing Energy Consumption through the Union of Disjoint Set Forests Algorithm in Sensor Networks.	ICOIN	2007	DBLP DOI BibTeX RDF
19	Daniel Archambault, Tamara Munzner, David Auber	Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components.	IEEE Trans. Vis. Comput. Graph.	2006	DBLP DOI BibTeX RDF	Graph and Network Visualization, Quasi-Tree