Search results for "Spanning Tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	He Jiang, Yudong Chen	An efficient algorithm for generalized minimum spanning tree problem.	GECCO	2010	DBLP DOI BibTeX RDF	candidate set, generalized minimum spanning tree, local search
3	Longcheng Liu, Qin Wang	Constrained inverse min-max spanning tree problems under the weighted Hamming distance.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Min-max spanning tree, Inverse problems, Hamming distance, Strongly polynomial algorithms
3	Fangqing Gu, Hailin Liu, Wei Liu	A bounded diameter minimum spanning tree evolutionary algorithm based on double chromosome.	GEC Summit	2009	DBLP DOI BibTeX RDF	double chromosome, the bounded diameter minimum spanning tree, evolutionary algorithm, local search
3	Huynh Thi Thanh Binh, Robert I. McKay, Nguyen Xuan Hoai, Nguyen Duc Nghia	New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, heuristic algorithm, hybrid genetic algorithm, multi-parent crossover
3	Sílvia M. D. Monteiro, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg	A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem.	EvoCOP	2009	DBLP DOI BibTeX RDF	Biobjective minimum spanning tree, plasmid, transgenetic algorithm
3	Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu	A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems.	MDAI	2009	DBLP DOI BibTeX RDF	k-minimum spanning tree, ant colony optimization, tabu search, hybrid algorithm, approximate solution
3	Yifeng Zeng, Jorge Cordero Hernandez, Shuyuan Lin	Spanning Tree Based Attribute Clustering.	PAKDD	2009	DBLP DOI BibTeX RDF	Clustering, Maximum Spanning Tree
3	Andreas Darmann, Ulrich Pferschy, Joachim Schauer	Determining a Minimum Spanning Tree with Disjunctive Constraints.	ADT	2009	DBLP DOI BibTeX RDF	minimum spanning tree, conflict graph
3	Stefan Voß	Capacitated Minimum Spanning Trees.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Capacitated minimum spanning tree problem, Terminal layout problem, Resource-constrained minimum spanning tree problem, Combinatorial optimization, Telecommunication, Spanning tree
3	Bin Hu, Markus Leitner, Günther R. Raidl	Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Generalized minimum spanning tree, Dynamic programming, Integer linear programming, Variable neighborhood search
3	Yury Nikulin	Simulated annealing algorithm for the robust spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Robust spanning tree, Simulated annealing, Uncertainty
3	Baruch Awerbuch, Israel Cidon, Shay Kutten	Optimal maintenance of a spanning tree.	J. ACM	2008	DBLP DOI BibTeX RDF	optimal message complexity, Distributed algorithms, spanning tree, leader election, dynamic networks, topological changes, amortized complexity
3	José Elias Claudio Arroyo, Pedro Sampaio Vieira, Dalessandro Soares Vianna	A GRASP algorithm for the multi-criteria minimum spanning tree problem.	Annals OR	2008	DBLP DOI BibTeX RDF	GRASP algorithm, Multi-criteria combinatorial optimization, Minimum spanning tree
3	Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger	A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Knapsack Constrained Maximum Spanning Tree, Lagrangian Decomposition, Volume Algorithm, Evolutionary Algorithm, Local Search, Hybrid Approach
3	Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel	Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks.	ICDCN	2008	DBLP DOI BibTeX RDF	distributed algorithms, mobile agents, spanning tree, proofs
3	Sylvain Dahan, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe	Performances Study of the Distributed Spanning Tree an Overlay Network for Server Lookup.	ICIW	2008	DBLP DOI BibTeX RDF	Distributed Spanning Tree, Simulations, Overlay networks
3	Qiang He, Chee-Hung Henry Chu	A New Image Segmentation Technique Using Maximum Spanning Tree.	IWCIA	2008	DBLP DOI BibTeX RDF	affinity matrix, image segmentation, maximum spanning tree
3	Huynh Thi Thanh Binh, Truong Binh Nguyen	New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem.	PRICAI	2008	DBLP DOI BibTeX RDF	degree constrained minimum spanning tree, genetic algorithm, particle swarm optimization, swarm intelligent
3	Martin Gruber, Günther R. Raidl	Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.	SAINT	2008	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, local search, tabu search, branch-and-cut
3	Miqing Li, Jinhua Zheng, Jun Wu	Improving NSGA-II Algorithm Based on Minimum Spanning Tree.	SEAL	2008	DBLP DOI BibTeX RDF	Crowding distance, Multi-objective optimization, Minimum spanning tree, Multi-objective evolutionary algorithm
3	Dorabella Santos, Amaro de Sousa, Filipe Alvelos	Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing.	FITraMEn	2008	DBLP DOI BibTeX RDF	multiple spanning tree routing, integer programming, column generation
3	Alok Singh, Ashok Kumar Gupta	Improved heuristics for the bounded-diameter minimum spanning tree problem.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm
3	Petrica C. Pop	On the prize-collecting generalized minimum spanning tree problem.	Annals OR	2007	DBLP DOI BibTeX RDF	Generalized minimum spanning tree problem, Combinatorial optimization, Minimum spanning trees, Linear relaxation
3	Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro	Distributed Computation of All Node Replacements of a Minimum Spanning Tree.	Euro-Par	2007	DBLP DOI BibTeX RDF	Replacement Tree, Distributed Algorithms, Minimum Spanning Tree, Node Failure
3	Gábor Salamon	Approximation Algorithms for the Maximum Internal Spanning Tree Problem.	MFCS	2007	DBLP DOI BibTeX RDF	Spanning tree leaves, Approximation algorithm, Hamiltonian path
3	Longcheng Liu, Enyu Yao	Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance.	ESCAPE	2007	DBLP DOI BibTeX RDF	Min-max spanning tree, Inverse problem, Hamming distance, Strongly polynomial algorithms
3	Kazuhiro Suzuki	A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph.	Graphs and Combinatorics	2006	DBLP DOI BibTeX RDF	Heterochromatic, Spanning tree, Edge-coloring, Rainbow, Multicolored
3	Prabha Sharma	Algorithms for the optimum communication spanning tree problem.	Annals OR	2006	DBLP DOI BibTeX RDF	Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution
3	Guojing Cong, Simone Sbaraglia	A Study on the Locality Behavior of Minimum Spanning Tree Algorithms.	HiPC	2006	DBLP DOI BibTeX RDF	memory locality, graph algorithm, minimum spanning tree
3	Thang Nguyen Bui, Catherine M. Zrncic	An ant-based algorithm for finding degree-constrained minimum spanning tree.	GECCO	2006	DBLP DOI BibTeX RDF	degree constrained spanning tree, ant algorithm
3	Martin Gruber, Jano I. van Hemert, Günther R. Raidl	Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO.	GECCO	2006	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree problem, variable neighbourhood search, evolutionary computation, ant colony optimisation
3	Thomas Hérault, Pierre Lemarinier, Olivier Peres, Laurence Pilard, Joffroy Beauquier	Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems.	SSS	2006	DBLP DOI BibTeX RDF	Spanning Tree Construction, Distributed Algorithm, Self-Stabilization, Failure Detectors, Large Scale Systems
3	Yong He, Binwu Zhang, Enyu Yao	Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	minimum spanning tree, inverse problem, strongly polynomial algorithm
3	Gustavo Bergantiños, Leticia Lorenzo	Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems.	Annals OR	2005	DBLP DOI BibTeX RDF	cost spanning tree problem, optimality
3	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.	ESA	2005	DBLP DOI BibTeX RDF	min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
3	Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee	The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	multiple sequence alignment, evolutionary tree, minimal spanning tree
3	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms
3	Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink	Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.	Algorithmica	2004	DBLP DOI BibTeX RDF	Minimum diameter spanning tree, Approximation algorithm, Geometric graph
3	Enrico Nardelli, Guido Proietti, Peter Widmayer	Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.	Algorithmica	2004	DBLP DOI BibTeX RDF	Transient node failures, Fault tolerance, Graph algorithms, Minimum spanning tree, Algorithmic mechanism design
3	Guojing Cong, David A. Bader	The Euler Tour Technique and Parallel Rooted Spanning Tree.	ICPP	2004	DBLP DOI BibTeX RDF	High-Performance Algorithm Engineering, Shared Memory, Spanning Tree, Parallel Graph Algorithms, Euler Tour
3	Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang	Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.	ICCSA	2004	DBLP DOI BibTeX RDF	approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem
3	Michael Elkin	Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem.	STOC	2004	DBLP DOI BibTeX RDF	minimum spanning tree, hardness of approximation
3	Seth Pettie, Vijaya Ramachandran	An optimal minimum spanning tree algorithm.	J. ACM	2002	DBLP DOI BibTeX RDF	optimal complexity, Graph algorithms, minimum spanning tree
3	Li-Jen Mao, Sheau-Dong Lang	Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique.	ICPP Workshops	2002	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal
3	B. Das, Michael C. Loui	Reconstructing a Minimum Spanning Tree after Deletion of Any Node.	Algorithmica	2001	DBLP DOI BibTeX RDF	Node deletion, Node replacement, Minimum spanning tree, CREW PRAM
3	Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup	Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.	J. ACM	2001	DBLP DOI BibTeX RDF	2-edge connectivity, connectivity, minimum spanning tree, dynamic graph algorithms, Biconnectivity
3	Orly Yadid-Pecht	Widening the dynamic range of pictures using a minimum spanning tree algorithm.	Mach. Vis. Appl.	2000	DBLP DOI BibTeX RDF	Image processing, Minimum-spanning tree, Robot vision, Dynamic range
3	Seth Pettie, Vijaya Ramachandran	An Optimal Minimum Spanning Tree Algorithm.	ICALP	2000	DBLP DOI BibTeX RDF	optimal complexity, Graph algorithms, minimum spanning tree
3	Wim H. Hesselink	The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.	Formal Asp. Comput.	1999	DBLP DOI BibTeX RDF	Message passing, Theorem proving, Minimum spanning tree, Asynchronous communication
3	Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang	A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.	ISPAN	1999	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
3	Hsueh-I Lu, R. Ravi	A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.	ISPAN	1997	DBLP DOI BibTeX RDF	Maximum-leaf spanning tree, Approximation algorithms, Performance guarantee, Approximation ratio
3	Michalis Faloutsos, Mart Molle	What features really make distributed minimum spanning tree algorithms efficient?. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	distributed minimum spanning tree, Distributed Information, computational complexity, distributed algorithms, graph theory, multiprocessor interconnection networks, communication complexity, running times, performance improvement, complexity measures, message complexity
3	Joseph C. Jacob, Soo-Young Lee	A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping. (PDF / PS)	HPDC	1995	DBLP DOI BibTeX RDF	spanning tree based recursive refinement algorithm, fast task mapping, tasks movement, structural characteristics, mapping quality, distributed system, parallel algorithms, resource allocation, distributed processing, optimisation, parallel systems, network of workstations, dynamic load balancing, recursive functions
2	William B. March, Parikshit Ram, Alexander G. Gray	Fast euclidean minimum spanning tree: algorithm, analysis, and applications.	KDD	2010	DBLP DOI BibTeX RDF	adaptive algorithm analysis, euclidean minimum spanning trees
2	Shaun Bangay, David de Bruyn, Kevin R. Glass	Minimum spanning trees for valley and ridge characterization in digital elevation maps.	Afrigraph	2010	DBLP DOI BibTeX RDF	graph, minimum spanning tree, line, DEM, ridge
2	Wolfgang Steitz, Franz Rothlauf	Solving OCST problems with problem-specific guided local search.	GECCO	2010	DBLP DOI BibTeX RDF	optimal communications spanning tree, problem-specific adaptation, guided local search
2	Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali	Efficient distributed random walks with applications.	PODC	2010	DBLP DOI BibTeX RDF	decentralized computation, random spanning tree, distributed algorithms, random walks, random sampling, mixing time
2	Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang	Computing label-constraint reachability in graph databases.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	generalized transitive closure, hoeffding and bernstein bounds, label-constraint reachability, maximal directed spanning tree
2	Rajeev Kumar, Bipul Kumar Bal, Peter Rockett	Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem: MOGP for BDMST.	GECCO	2009	DBLP DOI BibTeX RDF	genetic algorithm, genetic programming, heuristics, combinatorial optimization, multiobjective optimization, optimization methods, bloat, pareto front
2	Henning Fernau, Serge Gaspers, Daniel Raible	Exact and Parameterized Algorithms for Max Internal Spanning Tree.	WG	2009	DBLP DOI BibTeX RDF
2	Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu	On the Red/Blue Spanning Tree Problem.	TAMC	2009	DBLP DOI BibTeX RDF
2	Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng	Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs.	TAMC	2009	DBLP DOI BibTeX RDF
2	Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis	Self-stabilizing minimum-degree spanning tree within one from the optimal degree.	IPDPS	2009	DBLP DOI BibTeX RDF
2	Andrea Francke, Michael Hoffmann	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
2	Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar	On the Directed Degree-Preserving Spanning Tree Problem.	IWPEC	2009	DBLP DOI BibTeX RDF
2	Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.	IWPEC	2009	DBLP DOI BibTeX RDF
2	Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada	Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.	OPODIS	2009	DBLP DOI BibTeX RDF
2	Martin Knauer, Joachim Spoerhase	Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.	WADS	2009	DBLP DOI BibTeX RDF
2	Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil	A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property.	DISC	2009	DBLP DOI BibTeX RDF
2	Vibhav Vineet, Pawan Harish, Suryakant Patidar, P. J. Narayanan	Fast minimum spanning tree for large graphs on the GPU.	High Performance Graphics	2009	DBLP DOI BibTeX RDF
2	Santiago Vazquez-Rodriguez, Richard J. Duro	A Strategy for Evolutionary Spanning Tree Construction within Constrained Graphs with Application to Electrical Networks.	IWINAC	2009	DBLP DOI BibTeX RDF
2	Martin Gruber, Günther R. Raidl	Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics.	EUROCAST	2009	DBLP DOI BibTeX RDF
2	Mario Ruthmair, Günther R. Raidl	A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.	EUROCAST	2009	DBLP DOI BibTeX RDF
2	Stefan Ruzika, Horst W. Hamacher	A Survey on Multiple Objective Minimum Spanning Tree Problems.	Algorithmics of Large and Complex Networks	2009	DBLP DOI BibTeX RDF
2	Dániel Horváth, Gábor Kapitány, Sándor Plósz, István Moldován, Csaba Lukovszki	Ring Flushing for Reduced Overload in Spanning Tree Protocol Controlled Ethernet Networks.	EUNICE	2009	DBLP DOI BibTeX RDF	ring flushing, rstp, spanning trees, Ethernet, flooding
2	Dae Young Seo, D. T. Lee, Tien-Ching Lin	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
2	Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé	A Linear Vertex Kernel for Maximum Internal Spanning Tree.	ISAAC	2009	DBLP DOI BibTeX RDF
2	Akio Fujiyoshi	Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.	CIAA	2009	DBLP DOI BibTeX RDF
2	Benjamin T. Fine	Unsupervised anomaly detection with minimal sensing.	ACM Southeast Regional Conference	2009	DBLP DOI BibTeX RDF	clustering, anomaly detection, unsupervised learning, minimal spanning tree
2	Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yokoo	Adaptive price update in distributed Lagrangian relaxation protocol.	AAMAS	2009	DBLP DOI BibTeX RDF	distributed combinatorial optimization, generalized assignment, synchronization, spanning tree, Lagrangian relaxation, subgradient optimization
2	Martin Gruber, Günther R. Raidl	Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, construction heuristics, greedy randomized search, local improvement, dynamic programming
2	Wolfgang Steitz, Franz Rothlauf	New insights into the OCST problem: integrating node degrees and their location in the graph.	GECCO	2009	DBLP DOI BibTeX RDF	optimal communications spanning tree, evolutionary algorithm, heuristics, initialization
2	Stelios Timotheou, Georgios Loukas	Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios.	SAC	2009	DBLP DOI BibTeX RDF	uncertainty, minimum spanning tree, emergency response, autonomous robots, disaster management
2	David Eppstein	Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	pants decomposition, sum of cluster sizes, approximation algorithm, Hierarchical clustering, minimum spanning tree, hyperbolic geometry
2	Khaled Elmeleegy, Alan L. Cox, T. S. Eugene Ng	Understanding and mitigating the effects of count to infinity in Ethernet networks.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	spanning tree protocols, reliability, ethernet, Ethernet
2	Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin	Average-Case Analyses of Vickrey Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
2	Helena Molina-Abril, Pedro Real	Homological Computation Using Spanning Trees.	CIARP	2009	DBLP DOI BibTeX RDF	digital volume, tree, spanning tree, homology, Cell complex, gradient vector field, chain homotopy
2	Ling Song, Jun Ma, Jingsheng Lei, Dongmei Zhang, Zhen Wang	Semantic Structural Similarity Measure for Clustering XML Documents.	WISM	2009	DBLP DOI BibTeX RDF	XML document similarity, Clustering, Minimal spanning tree
2	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Labeling Schemes for Tree Representation.	Algorithmica	2009	DBLP DOI BibTeX RDF	Spanning tree, Labeling scheme, Tree representation
2	Seth Pettie, Vijaya Ramachandran	Randomized minimum spanning tree algorithms using exponentially fewer random bits.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Graph algorithms, minimum spanning trees, random sampling
2	Bruce L. Golden, S. Raghavan, Daliborka Stanojevic	The prize-collecting generalized minimum spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Genetic algorithms, Networks, Heuristics, Local search, Branch-and-cut
2	Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade	Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 20E28, 20G40, 20C20
2	Julien Clément, Thomas Hérault, Stéphane Messika, Olivier Peres	On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems.	PRDC	2008	DBLP DOI BibTeX RDF
2	Arindam Khaled, Bryant A. Julstrom	Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem.	GECCO	2008	DBLP DOI BibTeX RDF	bounded labels, labeled spanning trees, genetic algorithms, local search, greedy heuristics
2	Telma Woerle de Lima, Franz Rothlauf, Alexandre C. B. Delbem	The node-depth encoding: analysis and application to the bounded-diameter minimum spanning tree problem.	GECCO	2008	DBLP DOI BibTeX RDF	genetic algorithms, performance analysis, representations
2	Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng	Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.	ICIC	2008	DBLP DOI BibTeX RDF
2	Victor Ströele A. Menezes, Ricardo Tadeu da Silva, Moisés Ferreira de Souza, Jonice Oliveira, Carlos Eduardo R. de Mello, Jano Moreira de Souza, Geraldo Zimbrão	Mining and Analyzing Organizational Social Networks Using Minimum Spanning Tree.	OTM Workshops	2008	DBLP DOI BibTeX RDF	scientific social networks, Data mining, Social networks analysis
2	Serge Gaspers, Saket Saurabh, Alexey A. Stepanov	A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.	TAMC	2008	DBLP DOI BibTeX RDF
2	Guojing Cong, Hanhong Xue	A scalable, asynchronous spanning tree algorithm on a cluster of SMPs.	IPDPS	2008	DBLP DOI BibTeX RDF
2	Hon Sun Chiu, Bin Wu, Kwan Lawrence Yeung, King-Shan Lui	Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks.	WCNC	2008	DBLP DOI BibTeX RDF