Search results for "Spanning-Tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	Maarten Löffler, Jack Snoeyink	Delaunay triangulations of imprecise pointsin linear time after preprocessing.	SCG	2008	DBLP DOI BibTeX RDF	data imprecision, delaunay triangulation, minimum spanning tree, gabriel graph
26	Sajad Najafi Ravadanegh	A New GA - Based and Graph Theory Supported Distribution System Planning.	ICIC (3)	2008	DBLP DOI BibTeX RDF	Genetic Algorithm, Graph Theory, DSP, Minimum Spanning Tree
26	Wuu Yang, Huei-Ru Tseng, Rong-Hong Jan, Bor-Yeh Shen	Broadcasting with the Least Energy is an NP-Complete Problem.	MUE	2008	DBLP DOI BibTeX RDF	least-energy problem, maximum-leaf spanning-tree problem, wireless network, graph theory, NP-complete
26	Weiya Guo, Zhenhua Li, Dan Zhao, Tim Wong	A K-Nearest-Neighbors Pareto Rank Assignment Strategy and Compound Crossover Operator Based NSGA-II and Its Applications on Multi-objective Optimization Functions.	ISICA	2008	DBLP DOI BibTeX RDF	Compound Crossover Operator, Evolutionary Algorithm, Minimum Spanning Tree, K-Nearest-Neighbors, Multi-Objective, NSGA-II
26	Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard	Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.	SOFSEM	2008	DBLP DOI BibTeX RDF	Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data
26	Yongwook Choi, Maleq Khan, V. S. Anil Kumar 0001, Gopal Pandurangan	Energy-optimal distributed algorithms for minimum spanning trees.	SPAA	2008	DBLP DOI BibTeX RDF	distributed algorithm, energy-efficient, minimum spanning tree, distributed approximation algorithm
26	Carlos Abalde, Víctor M. Gulías, Laura M. Castro	Efficient Discovery of Widely Distributed and Non-volatile Resources on DHTs.	ICIW	2008	DBLP DOI BibTeX RDF	Routing Index, Peer-to-Peer, Distributed Hash Table, Spanning-Tree, Resource Discovery
26	Angel Domingo Sappa, Miguel Ángel García	Generating compact representations of static scenes by means of 3D object hierarchies.	Vis. Comput.	2007	DBLP DOI BibTeX RDF	Object clustering, Minimum distance computation, Minimum spanning tree, Hierarchical representation, World modeling
26	Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar	Local MST computation with short advice.	SPAA	2007	DBLP DOI BibTeX RDF	distributed algorithm, minimum spanning tree, local computation
26	Jean Frédéric Myoupo, David Semé	Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.	J. Supercomput.	2006	DBLP DOI BibTeX RDF	Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point
26	Zvi Lotker, Boaz Patt-Shamir, David Peleg	Distributed MST for constant diameter graphs.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Minimum-weight spanning tree, Distributed algorithm
26	Manuel Esteve, Carlos Enrique Palau	A Flexible Video Streaming System for Urban Traffic Control.	IEEE Multim.	2006	DBLP DOI BibTeX RDF	urban traffic control, spanning tree protocols, hierarchical network structure, fault tolerance, scalability, video streaming, communication network, flexibility, multimedia network
26	Michele Flammini, Alfredo Navarra, Stephane Perennes	The "real" approximation factor of the MST heuristic for the minimum energy broadcasting.	ACM J. Exp. Algorithmics	2006	DBLP DOI BibTeX RDF	Ad-hoc networks, broadcast, spanning tree, energy saving
26	Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, Toshimitsu Masuzawa	Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework.	SSS	2006	DBLP DOI BibTeX RDF	Composition, Self-stabilization, Minimum Spanning Tree, Median, Fault-containment
26	Stefan Steiniger, Dirk Burghardt, Robert Weibel	Recognition of island structures for map generalization.	GIS	2006	DBLP DOI BibTeX RDF	cartometrics, polygon patterns, proximity graphs, perception, map generalization, minimal spanning tree, gestalt theory
26	Ji Zhang, Wynne Hsu, Mong-Li Lee	Clustering in Dynamic Spatial Databases.	J. Intell. Inf. Syst.	2005	DBLP DOI BibTeX RDF	multi-resolution clustering, data mining, spatial databases, Minimum Spanning Tree, incremental clustering
26	Xiang-Yang Li 0001	Localized Construction of Low Weighted Structure and Its Applications in Wireless Ad Hoc Networks.	Wirel. Networks	2005	DBLP DOI BibTeX RDF	low weight, ad hoc networks, broadcasting, minimum spanning tree, energy conservation
26	Qing Dai, Jie Wu 0001	Computation of Minimal Uniform Transmission Range in Ad Hoc Wireless Networks.	Clust. Comput.	2005	DBLP DOI BibTeX RDF	power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power
26	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm
26	Petko Yanev, Paolo Foschi, Erricos John Kontoghiorghes	Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns.	Algorithmica	2004	DBLP DOI BibTeX RDF	Minimum spanning tree, QR decomposition, Givens rotations
26	Akshay Sharma, Carl Ebeling, Scott Hauck	PipeRoute: a pipelining-aware router for FPGAs.	FPGA	2003	DBLP DOI BibTeX RDF	BFS, PipeRoute, retimed circuits, routing, pipelining, minimum spanning tree, retiming, pipelined circuits
26	Qing Dai, Jie Wu 0001	Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks.	ICDCS Workshops	2003	DBLP DOI BibTeX RDF	power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power
26	Jeonghun Cho, Yunheung Paek, David B. Whalley	Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms.	LCTES-SCOPES	2002	DBLP DOI BibTeX RDF	dual memory, memory assignment, non-orthogonal architecture, compiler, graph coloring, maximum spanning tree
26	Brigitte Vallée	Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes.	Algorithmica	2001	DBLP DOI BibTeX RDF	Node deletion, Node replacement, Minimum spanning tree, CREW PRAM
26	Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain	Self-stabilizing depth-first token circulation in arbitrary rooted networks.	Distributed Comput.	2000	DBLP DOI BibTeX RDF	Self-stabilization, Spanning tree, Distributed mutual exclusion, Token passing
26	Joachim Giesen	Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem.	DGCI	1999	DBLP DOI BibTeX RDF	Traveling Salesman Problem, Minimum Spanning Tree, Curve Reconstruction
26	Horng-Ren Tsai, Shi-Jinn Horng, Shun-Shan Tsai, Tzong-Wann Kao, Shung-Shing Lee	Solving an Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Hyper-bus broadcast network, matrix multiplication operation, minimum-weight spanning tree, parallel algorithm, graph theory, connectivity, transitive closure, connected component, bridge, biconnected component, all-pair shortest paths, articulation point, algebraic path problem
26	A. Aydin Alatan, Ertem Tuncel, Levent Onural	A Rule-Based Method for Object Segmentation in Video Sequences.	ICIP (2)	1997	DBLP DOI BibTeX RDF	rule-based method, region level, rule-based region processing unit, accumulated previous segmentation data, true boundaries, recursive-shortest-spanning-tree algorithm, RSST algorithm, hierarchical-block-matching, HBM, tracking, standardization, color, MPEG-4, MPEG-7, frame, information fusion, video sequences, image colour analysis, object segmentation, motion information
26	Masafumi Yamashita, Tsunehiko Kameda	Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	edge election, spanning tree construction, topology recognition, distributed computing, knowledge, leader election, Anonymous network
26	Xiaohua Jia, Jiannong Cao 0001, Weijia Jia 0001	Real-time multicast routing with optimal network cost.	RTCSA	1996	DBLP DOI BibTeX RDF	real-time multicast routing, optimal network cost, minimal network cost, shortest network delay, optimal overall network cost, minimum spanning tree heuristic, delay, time constraint, real-time applications, NP-complete problem, telecommunication channels
26	Si-Qing Zheng, Joon Shik Lim, S. Sitharama Iyengar	Routing using implicit connection graphs [VLSI design.	VLSI Design	1996	DBLP DOI BibTeX RDF	implicit connection graphs, shortest path related problems, minimum spanning tree problem, sparse strong connection graph, large VLSI design applications, VLSI, graph theory, search problems, circuit layout CAD, VLSI layout, integrated circuit layout, obstacles, search behavior
26	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST.	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
26	I. S. I. Abuhaiba, S. Datta, Murray J. J. Holt	Line extraction and stroke ordering of text pages.	ICDAR	1995	DBLP DOI BibTeX RDF	stroke ordering, text pages, handwritten text, shortest spanning tree, closest main stroke, ordered list, variable handwriting, character recognition, handwriting recognition, line extraction
26	David Meyers, Shelley Skinner, Kenneth R. Sloan	Surfaces from Contours.	ACM Trans. Graph.	1992	DBLP DOI BibTeX RDF	branching problem, branching surfaces, meshes, surface reconstruction, minimum spanning tree, tiling, surface fitting, correspondence problem
26	Matthew S. Hecht, Jeffrey D. Ullman	Analysis of a Simple Algorithm for Global Flow Problems.	POPL	1973	DBLP DOI BibTeX RDF	available expressions, depth-first spanning tree, global data flow analysis, live variables, reducibility, dominance, code optimization, interval analysis, flow graph
26	B. S. Panda 0001, Anita Das 0001	A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees.	CIT	2004	DBLP DOI BibTeX RDF	Tree Spanner, Distance in Graphs, 2-trees, Graph Algorithms
26	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le	Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.	ISAAC	2002	DBLP DOI BibTeX RDF
25	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
25	Bruce L. Golden, S. Raghavan 0001, 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
25	Corinne Feremans, Alexander Grigoriev, René Sitters	The geometric generalized minimum spanning tree problem with grid clustering.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 68Q17, 68W25
25	Yuan-Long Jeang, Chung-Wei Hung, Chuen-Muh Chiang	A Methodology Based on Maximal-Profit Spanning Tree for Designing Application Specific Networks on Chip (ASNOC).	ICICIC (2)	2006	DBLP DOI BibTeX RDF
25	Kevin L. Steele, Parris K. Egbert	Minimum Spanning Tree Pose Estimation.	3DPVT	2006	DBLP DOI BibTeX RDF
25	Sang-Moon Soak, David Corne, Byung-Ha Ahn	A New Encoding for the Degree Constrained Minimum Spanning Tree Problem.	KES	2004	DBLP DOI BibTeX RDF
25	Yu Li	An Effective Implementation of a Direct Spanning Tree Representation in GAs.	EvoWorkshops	2001	DBLP DOI BibTeX RDF
25	Yuval Emek, David Peleg	A tight upper bound on the probabilistic embedding of series-parallel graphs.	SODA	2006	DBLP DOI BibTeX RDF
25	Filip De Greve, Frederic Van Quickenborne, Filip De Turck, Ingrid Moerman, Piet Demeester	Optimizing Routing Schemes for Fast Moving Users in MST-Based Networks.	EuroNGI Workshop	2005	DBLP DOI BibTeX RDF	spanning trees, Ethernet, user mobility
25	Bryant A. Julstrom	Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys.	GECCO (1)	2004	DBLP DOI BibTeX RDF
25	Feng Bao 0004, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi	Reliable broadcasting and secure distributing in channel networks.	ISPAN	1997	DBLP DOI BibTeX RDF	channel networks, secure message distributing, message distribution schemes, secret sharing, spanning trees, security of data, reliable broadcasting, fault-tolerant communication
25	Samir Khuller, Uzi Vishkin	Biconnectivity Approximations and Graph Carvings.	J. ACM	1994	DBLP DOI BibTeX RDF	sparse subgraphs, connectivity, biconnectivity
25	Torben Hagerup	An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees.	WG	2009	DBLP DOI BibTeX RDF
25	Yamin Li, Shietung Peng, Wanming Chu	A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks.	AINA	2008	DBLP DOI BibTeX RDF	overlay mesh, Mobile ad hoc networks, multicast, distributed algorithm, stability, efficiency
25	Thomas Gaube, Franz Rothlauf	The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters.	EvoWorkshops	2001	DBLP DOI BibTeX RDF
25	Paul Havlak	Nesting of Reducible and Irreducible Loops.	ACM Trans. Program. Lang. Syst.	1997	DBLP DOI BibTeX RDF	reducible loops, strongly-connected regions
25	Ephraim Korach, Zvi Ostfeld	DFS Tree Construction: Algorithms and Characterizations.	WG	1988	DBLP DOI BibTeX RDF
25	Dorit S. Hochbaum	Binary weights spanning trees and the k-red spanning tree problem in linear time.	CoRR	2024	DBLP DOI BibTeX RDF
25	Antoine Delaite, Gilles Pesant	Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems.	CPAIOR	2017	DBLP DOI BibTeX RDF
25	Simon Brockbank, Gilles Pesant, Louis-Martin Rousseau	Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems.	CP	2013	DBLP DOI BibTeX RDF
25	Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld	Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem.	ICGA	1995	DBLP BibTeX RDF
24	Krzysztof Krzywdzinski	A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs.	FCT	2009	DBLP DOI BibTeX RDF
24	Tamás Király, Lap Chi Lau, Mohit Singh	Degree Bounded Matroids and Submodular Flows.	IPCO	2008	DBLP DOI BibTeX RDF
24	Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung	Degree Bounded Network Design with Metric Costs.	FOCS	2008	DBLP DOI BibTeX RDF
24	Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri	Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks.	SECON	2008	DBLP DOI BibTeX RDF
24	Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan	Additive guarantees for degree bounded directed network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, directed graphs, network design
24	Ittai Abraham, Yair Bartal, Ofer Neiman	Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion.	SODA	2007	DBLP BibTeX RDF
24	Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth	Cuttings for Disks and Axis-Aligned Rectangles.	WADS	2007	DBLP DOI BibTeX RDF
24	Magnús M. Halldórsson, Christian Knauer, Andreas Spillner 0001, Takeshi Tokuyama	Fixed-Parameter Tractability for Non-Crossing Spanning Trees.	WADS	2007	DBLP DOI BibTeX RDF
24	Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom	Biased Mutation Operators for Subgraph-Selection Problems.	IEEE Trans. Evol. Comput.	2006	DBLP DOI BibTeX RDF
24	Manoel Lemos	Weight Distribution of the Bases of a Matroid.	Graphs Comb.	2006	DBLP DOI BibTeX RDF
24	Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer	Dynamic Analysis of the Arrow Distributed Protocol.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
24	Hsin-Chou Chi, Wen-Jen Wu	Routing Tree Construction for Interconnection Network with Irregular Topologies.	PDP	2003	DBLP DOI BibTeX RDF
24	Shlomi Dolev, Ronen I. Kat	Self-Stabilizing Distributed File Systems.	SRDS	2002	DBLP DOI BibTeX RDF
24	Thomas L. Rodeheffer, Chandramohan A. Thekkath, Darrell C. Anderson	SmartBridge: A scalable bridge architecture.	SIGCOMM	2000	DBLP DOI BibTeX RDF
24	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger	Parametric and Kinetic Minimum Spanning Trees.	FOCS	1998	DBLP DOI BibTeX RDF
24	Erich Prisner	Distance Approximating Spanning Trees.	STACS	1997	DBLP DOI BibTeX RDF
24	Baruch Awerbuch, Tripurari Singh	An Online Algorithm for the Dynamic Maximal Dense Tree Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Dense tree, Multicast, Dynamic, Online algorithms
24	Dagmar Handke, Guy Kortsarz	Tree Spanners for Subgraphs and Related Tree Covering Problems.	WG	2000	DBLP DOI BibTeX RDF
24	Dagmar Handke	Independent Tree Spanners.	WG	1998	DBLP DOI BibTeX RDF
23	Santiago Vazquez-Rodriguez, Richard J. Duro	A Strategy for Evolutionary Spanning Tree Construction within Constrained Graphs with Application to Electrical Networks.	IWINAC (2)	2009	DBLP DOI BibTeX RDF
23	Andrea Francke, Michael Hoffmann 0001	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	SCG	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
23	Martin Knauer, Joachim Spoerhase	Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.	WADS	2009	DBLP DOI BibTeX RDF
23	Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada 0001	Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.	OPODIS	2009	DBLP DOI BibTeX RDF
23	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
23	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
23	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
23	Stefano Bistarelli, Francesco Santini 0001	C-semiring Frameworks for Minimum Spanning Tree Problems.	WADT	2008	DBLP DOI BibTeX RDF
23	Ángel M. Pérez-Bellido, Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Antonio Portilla-Figueras, Maurizio Naldi	Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm.	SEAL	2008	DBLP DOI BibTeX RDF
23	Victor Ströele A. Menezes, Ricardo Tadeu da Silva, Moisés Ferreira de Souza, Jonice Oliveira, Carlos Eduardo Ribeiro 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
23	Guojing Cong, Hanhong Xue	A scalable, asynchronous spanning tree algorithm on a cluster of SMPs.	IPDPS	2008	DBLP DOI BibTeX RDF
23	Fangguo He, Huan Qi	Multi-objective Optimization for the Degree-Constrained Minimum Spanning Tree.	CSSE (4)	2008	DBLP DOI BibTeX RDF
23	Steven Bitner, Ovidiu Daescu	Finding a Minimum-Sum Dipolar Spanning Tree in R3.	HICSS	2008	DBLP DOI BibTeX RDF
23	Xue-xi Zhang, Yi-min Yang	Minimum Spanning Tree and Color Image Segmentation.	ICNSC	2008	DBLP DOI BibTeX RDF
23	Julien Clément 0002, 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
23	Shibiao Lin, Srikant Sharma, Tzi-cker Chiueh	Autonomic Resource Management for Multiple-Spanning-Tree Metro-Ethernet Networks.	NCA	2007	DBLP DOI BibTeX RDF
23	Jun Han, Zhaohao Sun, Jinpeng Huai, Xian Li	An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem.	ACIS-ICIS	2007	DBLP DOI BibTeX RDF	Partition, Branch and bound, Pruning, Search tree, Neighborhood search
23	Janna Burman, Shay Kutten	Time Optimal Asynchronous Self-stabilizing Spanning Tree.	DISC	2007	DBLP DOI BibTeX RDF
23	Haiyan Kang, Jichang Wu, Guojun Li	Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs.	FAW	2007	DBLP DOI BibTeX RDF	3-connected 3-regular graph, removable edge, edge-vertex-cut fragment
23	Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger	Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF
23	Pradip K. Srimani, Zhenyu Xu	Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set.	ICDCS Workshops	2007	DBLP DOI BibTeX RDF
23	Václav Novák, Zdenek Zabokrtský	Feature Engineering in Maximum Spanning Tree Dependency Parser.	TSD	2007	DBLP DOI BibTeX RDF
23	Yuhua Liu, Kaihua Xu, Hao Huang, Wei Teng	Research of Undirected Network Capacity Expansion Based on the Spanning-Tree.	SEAL	2006	DBLP DOI BibTeX RDF