Search results for "spanning trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Bryant A. Julstrom, Günther R. Raidl	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.	SAC	2002	DBLP DOI BibTeX RDF	random spanning trees, sets of edges, spanning trees, initialization
3	Cun-Quan Zhang, Yongbin Ou	Clustering, community partition and disjoint spanning trees.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	dynamic density, clustering, community, hierarchical clustering, Spanning trees, polynomial algorithm, dense subgraph
3	Jingli Li, Manli Chen, Yonghong Xiang, Shaowen Yao	Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees.	NPC	2007	DBLP DOI BibTeX RDF	(n and k)-star graph, a spanning tree, multiple spanning trees, all-port model, one-port model, all-to-all broadcasting, one-to-all broadcasting
3	Priscila C. Berbert, Leonardo J. R. Freitas Filho, Tiago A. Almeida, Márcia B. Carvalho, Akebo Yamakami	Artificial Immune System to Find a Set of k -Spanning Trees with Low Costs and Distinct Topologies.	ICARIS	2007	DBLP DOI BibTeX RDF	Artificial Immune Systems, Spanning Trees, Bio-inspired Computing
3	Kevin R. Hutson, Douglas R. Shier	Minimum spanning trees in networks with varying edge weights.	Annals OR	2006	DBLP DOI BibTeX RDF	Reliability, Networks, Sensitivity analysis, Spanning trees, Cutsets, Stochastic networks
3	Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng	Lower-stretch spanning trees.	STOC	2005	DBLP DOI BibTeX RDF	low-distortion embeddings, low-stretch spanning trees, probabilistic tree metrics
3	Stavros D. Nikolopoulos, Charis Papadopoulos	The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF	Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
3	Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung	Constructing Edge-Disjoint Spanning Trees in Product Networks.	IEEE Trans. Parallel Distrib. Syst.	2003	DBLP DOI BibTeX RDF	Cartesian product networks, edge-disjoint trees, fault-tolerance, interconnection networks, embedding, spanning trees
3	Chaomei Chen, Steven Morris	Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks.	INFOVIS	2003	DBLP DOI BibTeX RDF	co-citation networks, Pathfinder networks, minimum spanning trees, network visualization, Network evolution
3	Ka Wong Chong, Yijie Han, Tak Wah Lam	Concurrent threads and optimal parallel minimum spanning trees algorithm.	J. ACM	2001	DBLP DOI BibTeX RDF	parallel algorithms, minimum spanning trees, connected components, EREW PRAM
3	Dimiter R. Avresky	Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	single and multiple faults, Fault tolerance, reconfiguration, spanning trees, faulty hypercubes
3	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Constructing Light Spanning Trees with Small Routing Cost.	STACS	1999	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
3	Giuseppe F. Italiano, Rajiv Ramaswami	Maintaining Spanning Trees of Small Diameter.	Algorithmica	1998	DBLP DOI BibTeX RDF	Design and analysis of algorithms and data structures, Design and analysis of algorithms and data structures, Spanning trees, Spanning trees, Key words
3	Khaled Day, Anand R. Tripathi	A Comparative Study of Topological Properties of Hypercubes and Star Graphs.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	networktopology, interconnection network topologies, comparativestudy, parallel paths, asymptotically balanced, balanced spanning trees, graph theory, graph theory, hypercubes, multiprocessor interconnection networks, hypercube networks, spanning trees, star graphs, greedy
2	Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang	Independent Spanning Trees on Multidimensional Torus Networks.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	Independent spanning trees, internally disjoint paths, multidimensional torus, fault-tolerant broadcasting, parallel algorithms
2	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	ESA	2009	DBLP DOI BibTeX RDF
2	Navin Goyal, Luis Rademacher, Santosh Vempala	Expanders via random spanning trees.	SODA	2009	DBLP DOI BibTeX RDF
2	Feodor F. Dragan, Yang Xiang	How to Use Spanning Trees to Navigate in Graphs.	MFCS	2009	DBLP DOI BibTeX RDF
2	Fernand Meyer, Jean Stawiaski	Morphology on Graphs and Minimum Spanning Trees.	ISMM	2009	DBLP DOI BibTeX RDF	adjunctions on graphs, minimum spanning tree, Waterfall
2	Alejandro Cornejo, Nancy A. Lynch	Brief announcement: minimum spanning trees and cone-based topology control.	PODC	2009	DBLP DOI BibTeX RDF	topology control, minimum spanning trees
2	Jonathan A. Kelner, Aleksander Madry	Faster Generation of Random Spanning Trees.	FOCS	2009	DBLP DOI BibTeX RDF	random walks on graphs, electrical flows, spanning trees
2	Petr Kovár, Michael Kubesa	Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees.	IWOCA	2009	DBLP DOI BibTeX RDF
2	Naoki Katoh, Shin-ichi Tanigawa	A proof of the molecular conjecture.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity
2	Madeleine Davis-Moradkhan, Will N. Browne, Peter Grindrod	Extending evolutionary algorithms to discover tri-criterion and non-supported solutions for the minimum spanning tree problem.	GECCO	2009	DBLP DOI BibTeX RDF	multi criterion optimization, evolutionary algorithms, minimum spanning trees
2	Tadao Takaoka	Partial Solution and Entropy.	MFCS	2009	DBLP DOI BibTeX RDF	adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees
2	Andrew Adamatzky	From reaction-diffusion to Physarum computing.	Natural Computing	2009	DBLP DOI BibTeX RDF	Reaction-diffusion computing, Computational universality, Spanning trees, Biological computing
2	Kayhan Erciyes, Deniz Ozsoyeller, Orhan Dagdeviren	Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks.	ICCS	2008	DBLP DOI BibTeX RDF	clustering, wireless sensor networks, synchronizers, spanning tree
2	Paul S. Bonsma, Florian Zickfeld	Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms.	LATIN	2008	DBLP DOI BibTeX RDF
2	Ittai Abraham, Yair Bartal, Ofer Neiman	Nearly Tight Low Stretch Spanning Trees.	FOCS	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	David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth	Tight Bounds for Connecting Sites Across Barriers.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Spanning trees, Crossing number
2	Evan Thompson, Tim Paulden, David K. Smith	The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms.	IEEE Trans. Evolutionary Computation	2007	DBLP DOI BibTeX RDF
2	Ittai Abraham, Yair Bartal, Ofer Neiman	Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion.	SODA	2007	DBLP DOI BibTeX RDF
2	Minh Huynh, Prasant Mohapatra, Stuart Goose	Cross-over spanning trees Enhancing metro ethernet resilience and load balancing.	BROADNETS	2007	DBLP DOI BibTeX RDF
2	Celso C. Ribeiro, Rodrigo F. Toso	Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights.	WEA	2007	DBLP DOI BibTeX RDF	DRD-trees, algorithms, data structures, Minimum spanning trees, dynamic graph algorithms, experimental analysis
2	Fang Zhou, Jieyue He, Wei Zhong	Mutual Information based Minimum Spanning Trees Model for Selecting Discriminative Genes.	BIBE	2007	DBLP DOI BibTeX RDF
2	Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama	Fixed-Parameter Tractability for Non-Crossing Spanning Trees.	WADS	2007	DBLP DOI BibTeX RDF
2	Naoki Katoh, Shin-ichi Tanigawa	Enumerating Constrained Non-crossing Geometric Spanning Trees.	COCOON	2007	DBLP DOI BibTeX RDF
2	Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski	Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.	SOFSEM	2007	DBLP DOI BibTeX RDF
2	Mohit Singh, Lap Chi Lau	Approximating minimum bounded degree spanning trees to within one of optimal.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithm, spanning trees, bounded degree, iterative rounding
2	Frank Neumann, Ingo Wegener	Minimum spanning trees made easier via multi-objective optimization.	Natural Computing	2006	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis, working principles of evolutionary computing
2	Wookey Lee, Seungkil Lim	Maximum Rooted Spanning Trees for the Web.	OTM Workshops	2006	DBLP DOI BibTeX RDF
2	Bosiljka Tadic, Stefan Thurner	Traffic Noise and Maximum-Flow Spanning Trees on Growing and Static Networks.	International Conference on Computational Science	2006	DBLP DOI BibTeX RDF
2	Huaijun Qiu, Edwin R. Hancock	Graph Matching using Commute Time Spanning Trees.	ICPR	2006	DBLP DOI BibTeX RDF
2	Xiaoming He, Mingying Zhu, Qingxin Chu	Traffic Engineering for Metro Ethernet Based on Multiple Spanning Trees.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
2	Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta	On the Topologies of Local Minimum Spanning Trees.	CAAN	2006	DBLP DOI BibTeX RDF
2	Huaijun Qiu, Edwin R. Hancock	Spanning Trees from the Commute Times of Random Walks on Graphs.	ICIAR	2006	DBLP DOI BibTeX RDF
2	Michel X. Goemans	Minimum Bounded Degree Spanning Trees.	FOCS	2006	DBLP DOI BibTeX RDF
2	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
2	Francisco Barahona	Network reinforcement.	Math. Program.	2006	DBLP DOI BibTeX RDF	Network reinforcement, Spanning trees
2	Li Yang	Building k Edge-Disjoint Spanning Trees of Minimum Total Length for Isometric Data Embedding.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF	dimensionality reduction, minimum spanning tree, manifold learning, Data embedding, neighborhood graph
2	Frank Neumann, Ingo Wegener	Minimum spanning trees made easier via multi-objective optimization.	GECCO	2005	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis, working principles of evolutionary computing
2	Fan Zhang, Huaijun Qiu, Edwin R. Hancock	Evolving Spanning Trees Using the Heat Equation.	CAIP	2005	DBLP DOI BibTeX RDF
2	Ana Carolina Lorena, André Carlos Ponce Leon Ferreira de Carvalho	Minimum Spanning Trees in Hierarchical Multiclass Support Vector Machines Generation.	IEA/AIE	2005	DBLP DOI BibTeX RDF	Machine Learning, Support Vector Machines, multiclass classification
2	Mariusz Bajger, Fei Ma, Murk J. Bottema	Minimum Spanning Trees and Active Contours for Identification of the Pectoral Muscle in Screening Mammograms.	DICTA	2005	DBLP DOI BibTeX RDF
2	Barnabás Póczos, András Lörincz	Independent subspace analysis using geodesic spanning trees.	ICML	2005	DBLP DOI BibTeX RDF
2	Mohammad Erfanul Hoque Siddiqi, M. Emdadul Haque, M. Shahin, M. Belal Hossan	Spanning trees with restricted degrees for series-parallel graph.	GrC	2005	DBLP DOI BibTeX RDF
2	Hideo Saito, Kenjiro Taura, Takashi Chikayama	Collective operations for wide-area message passing systems using adaptive spanning trees.	GRID	2005	DBLP DOI BibTeX RDF
2	Bryant A. Julstrom	The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.	GECCO	2005	DBLP DOI BibTeX RDF	blob code, edge-sets, routing cost, codings, spanning trees
2	Raja Jothi, Balaji Raghavachari	Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.	ACM Transactions on Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, network design, Spanning trees, minimum spanning trees
2	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
2	Bryant A. Julstrom	Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys.	GECCO	2004	DBLP DOI BibTeX RDF
2	Mordecai J. Golin, Yiu-Cho Leung	Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.	WG	2004	DBLP DOI BibTeX RDF
2	Ran Mendelson, Mikkel Thorup, Uri Zwick	Meldable RAM priority queues and minimum directed spanning trees.	SODA	2004	DBLP DOI BibTeX RDF
2	Mohammad Sohel Rahman, Abul Kashem	Degree restricted spanning trees of graphs.	SAC	2004	DBLP DOI BibTeX RDF	algorithms, graphs, NP-completeness, spanning trees, Hamiltonian path
2	Baitao Long, Lifeng Sun, Wenping Chen, Yuzhuo Zhong	Improving the stability of spanning trees for application-layer multicast.	ISCC	2004	DBLP DOI BibTeX RDF
2	Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang	Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs.	ISAAC	2004	DBLP DOI BibTeX RDF
2	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	2004	DBLP DOI BibTeX RDF	Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation
2	Sridhar Radhakrishnan, Gopal Racherla, Chandra N. Sekharan, Nageswara S. V. Rao, Stephen Gordon Batsell	Protocol for Dynamic Ad-Hoc Networks Using Distributed Spanning Trees.	Wireless Networks	2003	DBLP DOI BibTeX RDF	simulation, routing, ad-hoc network, distributed algorithm, spanning tree
2	Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki	Spanning Trees Crossing Few Barriers.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF
2	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
2	Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia	Spanning Trees of Multicoloured Point Sets with Few Intersections.	IJCCGGT	2003	DBLP DOI BibTeX RDF
2	David Peleg	Spanning Trees with Low Maximum/Average Stretch.	CIAC	2003	DBLP DOI BibTeX RDF
2	Timothy M. Chan	Euclidean bounded-degree spanning tree ratios.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	approximation, minimum spanning trees, discrete geometry
2	Jochen Könemann, R. Ravi	Primal-dual meets local search: approximating MST's with nonuniform degree bounds.	STOC	2003	DBLP DOI BibTeX RDF	degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation
2	Lélia Blin, Franck Butelle	The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs.	IPDPS	2003	DBLP DOI BibTeX RDF	Minimum degree spanning trees, Distributed algorithms, Spanning trees, Asynchronous algorithms, general graphs
2	Toru Hasunuma	Completely Independent Spanning Trees in Maximal Planar Graphs.	WG	2002	DBLP DOI BibTeX RDF
2	David Peleg	Low Stretch Spanning Trees.	MFCS	2002	DBLP DOI BibTeX RDF
2	Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano	Maintaining Dynamic Minimum Spanning Trees: An Experimental Study.	ALENEX	2002	DBLP DOI BibTeX RDF
2	Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen	Some Applications of Orderly Spanning Trees in Graph Drawing.	Graph Drawing	2002	DBLP DOI BibTeX RDF
2	Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu	Orderly spanning trees with applications to graph encoding and graph drawing.	SODA	2001	DBLP DOI BibTeX RDF
2	Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen	Floor-Planning via Orderly Spanning Trees.	Graph Drawing	2001	DBLP DOI BibTeX RDF
2	Sayaka Nagai, Shin-Ichi Nakano	A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs.	WG	2000	DBLP DOI BibTeX RDF
2	Yuh-Shyan Chen, Tong-Ying Juang, Ying-Ying Shen	Multi-Node Broadcasting in an Arrangement Graph Using Multiple Spanning Trees. (PDF / PS)	ICPADS	2000	DBLP DOI BibTeX RDF	routing, parallel processing, interconnection network, broadcast, Arrangement graph
2	Xiao Zhou, Takao Nishizeki	Finding Independent Spanning Trees in Partial k-Trees.	ISAAC	2000	DBLP DOI BibTeX RDF
2	Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição	Finding Minimum Congestion Spanning Trees.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.	WG	1998	DBLP DOI BibTeX RDF
2	David Peleg, Eilon Reshef	Deterministic Polylog Approximation for Minimum Communication Spanning Trees.	ICALP	1998	DBLP DOI BibTeX RDF
2	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger	Parametric and Kinetic Minimum Spanning Trees.	FOCS	1998	DBLP DOI BibTeX RDF
2	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.	ISAAC	1998	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
2	Erich Prisner	Distance Approximating Spanning Trees.	STACS	1997	DBLP DOI BibTeX RDF
2	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
2	Tamal K. Dey	Improved Bounds on Planar k-sets and k-levels.	FOCS	1997	DBLP DOI BibTeX RDF	planar k-sets, k-levels, parametric minimum spanning trees, parametric matroids, computational complexity, line segments, combinatorial complexities, convex polygons
2	Feng Bao, 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
2	Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi	Independent Spanning Trees of Product Graphs.	WG	1996	DBLP DOI BibTeX RDF
2	Takeaki Uno	An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph.	ISAAC	1996	DBLP DOI BibTeX RDF	directed spanning tree, listing, enumerating algorithm
2	Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid	On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.	FSTTCS	1996	DBLP DOI BibTeX RDF
2	Harold N. Gabow, K. S. Manu	Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs.	IPCO	1995	DBLP DOI BibTeX RDF
2	Paraskevi Fragopoulou, Selim G. Akl	Fault tolerant communication algorithms on the star network using disjoint paths.	HICSS	1995	DBLP DOI BibTeX RDF	fault-tolerant communication algorithms, node pairs, directed edge-disjoint spanning trees, single-node broadcasting, multinode broadcasting, single-node scattering problem, all-port communication assumption, faulty edges, multinode scattering problem, interconnection networks, fault tolerant computing, broadcasting, graph, multiprocessor interconnection networks, trees (mathematics), disjoint paths, star network, message transmission, faulty nodes
2	Sabine R. Öhring, Sajal K. Das, Dirk H. Hohndel	Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks.	CONPAR	1994	DBLP DOI BibTeX RDF	arc-disjoint spanning trees, folded Petersen graph, fault-tolerance, communication, interconnection network