Search results for "Minimum Spanning Tree (MST)"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Victor Olman, Fenglou Mao, Hongwei Wu, Ying Xu	Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics.	IEEE/ACM Trans. Comput. Biology Bioinform.	2009	DBLP DOI BibTeX RDF	genome application, Pattern recognition, parallel processing, clustering algorithm
1	Yongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar	Energy-Optimal Distributed Algorithms for Minimum Spanning Trees.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	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
1	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
1	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
1	Wolfgang Steitz, Franz Rothlauf	Orientation matters: how to efficiently solve ocst problems with problem-specific EAs.	GECCO	2008	DBLP DOI BibTeX RDF	optimal communications spanning tree, evolutionary algorithm, heuristics, recombination operators
1	Yongwook Choi, Maleq Khan, V. S. Anil Kumar, 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
1	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
1	Avinash Srinivasan, Jie Wu	TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs.	ICCCN	2008	DBLP DOI BibTeX RDF
1	Xuqing Zhang, Fei Wu, Yueting Zhuang	Clustering by evidence accumulation on affinity propagation.	ICPR	2008	DBLP DOI BibTeX RDF
1	Godwin Shen, Antonio Ortega	Joint Routing and 2D Transform Optimization for Irregular Sensor Network Grids Using Wavelet Lifting.	IPSN	2008	DBLP DOI BibTeX RDF
1	Tamaghna Acharya, Rajarshi Roy, Samiran Chattopadhyay	Energy-Efficient Broadcasting in Wireless Ad Hoc Networks Using Directional Antennas.	VTC Spring	2008	DBLP DOI BibTeX RDF
1	Alexei N. Skurikhin	Proximity Graphs Based Multi-scale Image Segmentation.	ISVC	2008	DBLP DOI BibTeX RDF
1	Maleq Khan, Gopal Pandurangan	A fast distributed approximation algorithm for minimum spanning trees.	Distributed Computing	2008	DBLP DOI BibTeX RDF	Randomized algorithm, Minimum spanning tree, Distributed approximation algorithm
1	Rui-Sheng Wang, Shi-Hua Zhang, Xiang-Sun Zhang, Luonan Chen	Identifying Modules in Complex Networks by a Graph-Theoretical Method and Its Application in Protein Interaction Networks.	ICIC	2007	DBLP DOI BibTeX RDF	Minimum spanning tree (MST), complex network, protein interaction network, functional module
1	Rupesh S. Shelar	An efficent clustering algorithm for low power clock tree synthesis.	ISPD	2007	DBLP DOI BibTeX RDF	clustering, low power, clock tree synthesis
1	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
1	Subhasis Bhattacharjee, Nabanita Das	Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime.	ICCTA	2007	DBLP DOI BibTeX RDF
1	I-Shyan Hwang, Ren-Yuan Cheng, Zen-Der Shyu	A Novel Dynamic Multiple Rings-Based Local Restoration for One-to-Multipoint Multicast Traffic in WDM Mesh Networks.	ICN	2007	DBLP DOI BibTeX RDF
1	Carla Silva Rocha Aguiar, Sébastien Druon, André Crosnier	3D datasets segmentation based on local attribute variation.	IROS	2007	DBLP DOI BibTeX RDF
1	Ioannis Caragiannis, Michele Flammini, Luca Moscardelli	An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.	ICALP	2007	DBLP DOI BibTeX RDF
1	Xiang Fan, Shun-ren Xia	Feature Based Automatic Stitching of Microscopic Images.	ICIC	2007	DBLP DOI BibTeX RDF	BBF, SIFT, Image Stitching, Microscopic Image, MST
1	Amos Korman, Shay Kutten	Distributed verification of minimum spanning trees.	Distributed Computing	2007	DBLP DOI BibTeX RDF	Graph property verification, Proof labeling schemes, Self stabilization, Minimum spanning tree, Labeling schemes, Network algorithms
1	Qiong Cheng, Yanqing Zhang, Xiaolin Hu, Nisar Hundewale, Alexander Zelikovsky	Routing Using Messengers in Sparse and Disconnected Mobile Sensor Networks.	Advances in Web Intelligence and Data Mining	2006	DBLP DOI BibTeX RDF	Mobile Sensor Networks (MSN), Minimum Spanning Tree (MST), Dynamical Source Routing Protocol (DSR), Ad Hoc On Demand Distance Vector Routing (AODV), Disjoint Mobile Sensor Networks (DMSN), Straight Line Moving of Messengers (SLMM), Flexible Sharing Policy of Messengers (FSPM), Genetic Fuzzy Straight Line Moving of Messengers (GFSLMM), Genetic Fuzzy Flexible Sharing Policy of Messengers (GFFSPM), Genetic Algorithm (GA), Fuzzy Inference System
1	Amos Korman, Shay Kutten	Distributed verification of minimum spanning trees.	PODC	2006	DBLP DOI BibTeX RDF	graph property verification, proof labeling, distributed algorithms, self stabilization, minimum spanning tree, labeling schemes, network algorithms
1	Clinton Nielsen, Xiaobo Li	MST for Lossy Compression of Image Sets.	DCC	2006	DBLP DOI BibTeX RDF
1	Akshay Sharma, Carl Ebeling, Scott Hauck	PipeRoute: a pipelining-aware router for reconfigurable architectures.	IEEE Trans. on CAD of Integrated Circuits and Systems	2006	DBLP DOI BibTeX RDF
1	Toshihiro Fujito	How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.	ICALP	2006	DBLP DOI BibTeX RDF
1	Subhasis Bhattacharjee, Nabanita Das	Distributed Node-Based Transmission Power Control for Wireless Ad Hoc Networks.	ICDCIT	2006	DBLP DOI BibTeX RDF
1	Maleq Khan, Gopal Pandurangan	A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.	DISC	2006	DBLP DOI BibTeX RDF	Minimum Spanning Tree, Distributed Approximation Algorithm
1	Timothy M. Chan	Finding the shortest bottleneck edge in a parametric minimum spanning tree.	SODA	2005	DBLP DOI BibTeX RDF
1	Ahmed A. Belal, Amr Elmasry	Finding maximum-cost minimum spanning trees.	AICCSA	2005	DBLP DOI BibTeX RDF
1	Ning Li, Jennifer C. Hou, Lui Sha	Design and analysis of an MST-based topology control algorithm.	IEEE Transactions on Wireless Communications	2005	DBLP DOI BibTeX RDF
1	Songpu Shang, Xiaodong Hu, Tong Jing	Rotational Steiner Ratio Problem Under Uniform Orientation Metrics.	CJCDGCGT	2005	DBLP DOI BibTeX RDF	Uniform orientation metrics, VLSI design, Steiner tree, Steiner ratio
1	Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu	Merging Clustering Algorithms in Mobile Ad Hoc Networks.	ICDCIT	2005	DBLP DOI BibTeX RDF
1	Qing Dai, Jie Wu	Computation of Minimal Uniform Transmission Range in Ad Hoc Wireless Networks.	Cluster Computing	2005	DBLP DOI BibTeX RDF	power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power
1	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
1	Intae Kang, Radha Poovendran	Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks.	MONET	2005	DBLP DOI BibTeX RDF	ad hoc network, energy efficient, broadcast, routing protocols, network topology, algorithm/protocol design and analysis, graphs and networks
1	Hasan Arslan, Shantanu Dutt	An effective hop-based detailed router for FPGAs for optimizing track usage and circuit performance.	ACM Great Lakes Symposium on VLSI	2004	DBLP DOI BibTeX RDF	bump and refit paradigm, bumping cost, hop-based routing, switchbox, FPGAs, detailed routing, MST
1	Michel X. Goemans, Jan Vondrák	Covering minimum spanning trees of random subgraphs.	SODA	2004	DBLP DOI BibTeX RDF
1	Carsten Tzschoppe, Franz Rothlauf, Hans-Josef Pesch	The Edge-Set Encoding Revisited: On the Bias of a Direct Representation for Trees.	GECCO	2004	DBLP DOI BibTeX RDF
1	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
1	Michalis Faloutsos, Mart Molle	A linear-time optimal-message distributed algorithm for minimum spanning trees.	Distributed Computing	2004	DBLP DOI BibTeX RDF
1	Qing Dai, Jie Wu	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
1	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
1	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
1	Narsingh Deo, Ayman Abdalla	Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.	CIAC	2000	DBLP DOI BibTeX RDF
1	Enrico Nardelli, Guido Proietti, Peter Widmayer	Maintaining a Minimum Spanning Tree Under Transient Node Failures.	ESA	2000	DBLP DOI BibTeX RDF
1	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
1	David Peleg, Eilon Reshef	A Variant of the Arrow Distributed Directory with Low Average Complexity.	ICALP	1999	DBLP DOI BibTeX RDF
1	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST. (PDF / PS)	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
1	Gabriel Robins, Jeffrey S. Salowe	On the Maximum Degree of Minimum Spanning Trees.	Symposium on Computational Geometry	1994	DBLP DOI BibTeX RDF
1	Ting-Hai Chao, Yu-Chin Hsu	Rectilinear Steiner tree construction by local and global refinement.	IEEE Trans. on CAD of Integrated Circuits and Systems	1994	DBLP DOI BibTeX RDF
1	Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang	Closing the gap: near-optimal Steiner trees in polynomial time.	IEEE Trans. on CAD of Integrated Circuits and Systems	1994	DBLP DOI BibTeX RDF
1	Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong	New algorithms for the rectilinear Steiner tree problem.	IEEE Trans. on CAD of Integrated Circuits and Systems	1990	DBLP DOI BibTeX RDF
1	Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong	A New Approach to the Rectilinear Steiner Tree Problem.	DAC	1989	DBLP DOI BibTeX RDF