Search results for "Minimum spanning trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
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
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	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	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	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	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
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	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	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	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	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger	Parametric and Kinetic Minimum Spanning Trees.	FOCS	1998	DBLP DOI BibTeX RDF
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	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	David R. Karger	Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees	FOCS	1993	DBLP DOI BibTeX RDF	random edge failures, optimization, data structures, connectivity, minimum spanning trees, random sampling, matroids, graph connectivity, greedy methods
2	Pankaj K. Agarwal, David Eppstein, Jirí Matousek	Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees	FOCS	1992	DBLP DOI BibTeX RDF	Euclidean minimum spanning tree, half-space range reporting, minima, decomposable function, closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, minimum spanning trees, diameter, dynamic data structures, geometric optimization, geometric problems
2	Michael L. Fredman, Dan E. Willard	Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths	FOCS	1990	DBLP DOI BibTeX RDF	Fibonacci heap, trans-dichotomous algorithms, fusion tree method, information-theoretic limitations, atomic heap, amortized time, heap size, AF-heap, data structure, shortest paths, minimum spanning trees, linear-time algorithm, shortest-path algorithm
2	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points
2	Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong	Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	rectilinear metric, Computational geometry, shortest paths, minimum spanning trees, Steiner trees, obstacles
1	Rico Zenklusen	Matroidal degree-bounded minimum spanning trees.	SODA	2012	DBLP BibTeX RDF
1	Yan Zhou, Oleksandr Grygorash, Thomas F. Hain	Clustering with Minimum Spanning Trees.	International Journal on Artificial Intelligence Tools	2011	DBLP DOI BibTeX RDF
1	Rico Zenklusen	Matroidal Degree-Bounded Minimum Spanning Trees	CoRR	2011	DBLP BibTeX RDF
1	Katharina Skutella, Martin Skutella	Minimum Spanning Trees - Sometimes Greed Pays Off.	Algorithms Unplugged	2011	DBLP DOI BibTeX RDF
1	Pegah Kamousi, Timothy M. Chan, Subhash Suri	Stochastic minimum spanning trees in euclidean spaces.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella	On the Area Requirements of Euclidean Minimum Spanning Trees.	WADS	2011	DBLP DOI BibTeX RDF
1	Gonzalo Navarro, Rodrigo Paredes	On Sorting, Heaps, and Minimum Spanning Trees.	Algorithmica	2010	DBLP DOI BibTeX RDF
1	Madeleine Davis-Moradkhan	Multi-Criterion Optimization in Minimum Spanning Trees.	Stud. Inform. Univ.	2010	DBLP BibTeX RDF
1	Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano	Maintaining dynamic minimum spanning trees: An experimental study.	Discrete Applied Mathematics	2010	DBLP DOI BibTeX RDF
1	Caiming Zhong, Duoqian Miao, Ruizhi Wang	A graph-theoretical clustering method based on two rounds of minimum spanning trees.	Pattern Recognition	2010	DBLP DOI BibTeX RDF
1	Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe	Listing all the minimum spanning trees in an undirected graph.	Int. J. Comput. Math.	2010	DBLP DOI BibTeX RDF
1	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
1	Rudolf Mayer, Andreas Rauber	Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees.	ICANN	2010	DBLP DOI BibTeX RDF
1	Samidh Chatterjee, Michael Connor, Piyush Kumar	Geometric Minimum Spanning Trees with GeoFilterKruskal.	SEA	2010	DBLP DOI BibTeX RDF
1	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
1	Benjamin Doerr, Daniel Johannsen, Carola Winzen	Multiplicative drift analysis.	GECCO	2010	DBLP DOI BibTeX RDF	theory, running time analysis
1	Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerman	Continuity analysis of programs.	POPL	2010	DBLP DOI BibTeX RDF	stability, robustness, uncertainty, program analysis, continuity, errors, sensitivity, perturbations, proof rules
1	Jieyue He, Fang Zhou, Wei Zhong, Yi Pan	Gene subsets extraction based on Mutual-Information-based Minimum Spanning Trees model.	I. J. Computational Biology and Drug Design	2009	DBLP DOI BibTeX RDF
1	Kohei Inoue, Kiichi Urahama	Halftoning with minimum spanning trees and its application to maze-like images.	Computers & Graphics	2009	DBLP DOI BibTeX RDF
1	Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar	Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks.	IEEE Trans. Parallel Distrib. Syst.	2009	DBLP DOI BibTeX RDF
1	Wenbo V. Li, Xinyi Zhang	On the Difference of Expected Lengths of Minimum Spanning Trees.	Combinatorics, Probability & Computing	2009	DBLP DOI BibTeX RDF
1	Raja Jothi, Balaji Raghavachari	Degree-bounded minimum spanning trees.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	Artur Czumaj, Christian Sohler	Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
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	Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi	Planar bichromatic minimum spanning trees.	J. Discrete Algorithms	2009	DBLP DOI BibTeX RDF
1	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
1	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
1	Torben Hagerup	An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees.	WG	2009	DBLP DOI BibTeX RDF
1	Yaser Khamayseh, Wail Mardini, Muneer Bani Yassein	Performance evaluation of different minimum spanning trees schemes for scheduling in WMNS.	IADIS AC	2009	DBLP BibTeX RDF
1	Bowen Chen, Fangping Wei, Jiaxiu Pan, Yuxian Xia	The Minimum Spanning Trees of tRNA Sequences Based on Prim's Algorithm.	ICNC	2009	DBLP DOI BibTeX RDF
1	C. Patvardhan, V. Prem Prakash	Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter.	PReMI	2009	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Satish Rao, Samantha 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
1	Dietmar Cieslik	Network Design Problems.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Steiner minimal tree, Network, Shortest path, Minimum spanning trees, Network flows
1	Haim Kaplan, Uri Zwick	A simpler implementation and analysis of Chazelle's soft heaps.	SODA	2009	DBLP DOI BibTeX RDF
1	David Eppstein	Testing bipartiteness of geometric intersection graphs.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Hopcroft's problem, coin graph, geometric thickness, graph coloring, minimum spanning tree, Bipartite graph, line segments, disks, intersection graph
1	Benjamin P. Vandervalk, E. Luke McCarthy, Mark D. Wilkinson	Optimization of Distributed SPARQL Queries Using Edmonds' Algorithm and Prim's Algorithm.	CSE	2009	DBLP DOI BibTeX RDF
1	Paul Stockwell, Andrew E. Smith, Janet Wiles	Displaying a Framework in a Concept Map Using Network Graph Techniques.	IV	2009	DBLP DOI BibTeX RDF
1	Michael Stout, Jaume Bacardit, Jonathan D. Hirst, Robert Elliott Smith, Natalio Krasnogor	Prediction of topological contacts in proteins using learning classifier systems.	Soft Comput.	2009	DBLP DOI BibTeX RDF
1	Martin Mares	The saga of minimum spanning trees.	Computer Science Review	2008	DBLP DOI BibTeX RDF
1	Sören Laue, Domagoj Matijevic	Approximating k-hop minimum spanning trees in Euclidean metrics.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
1	Mourad Baïou, Francisco Barahona	A linear programming approach to increasing the weight of all minimum spanning trees.	Networks	2008	DBLP DOI BibTeX RDF
1	Artur Czumaj, Christian Sohler	Testing Euclidean minimum spanning trees in the plane.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Euclidean minimum spanning tree, randomized algorithms, property testing
1	Thomas Erlebach, Michael Hoffmann 0002, Danny Krizanc, Matús Mihalák, Rajeev Raman	Computing Minimum Spanning Trees with Uncertainty	CoRR	2008	DBLP 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	Giuseppe F. Italiano	Fully Dynamic Minimum Spanning Trees.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Tak Wah Lam	Parallel Connectivity and Minimum Spanning Trees.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Seth Pettie	Minimum Spanning Trees.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Sergio Rajsbaum	Distributed Algorithms for Minimum Spanning Trees.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Anthony Schmieder, Howard Cheng, Barry Gergel, Xiaobo Li	Hierarchical Minimum Spanning Trees for Lossy Image Set Compression.	IPCV	2008	DBLP BibTeX RDF
1	Michael Hoffmann 0002, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman	Computing Minimum Spanning Trees with Uncertainty.	STACS	2008	DBLP DOI BibTeX RDF
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	Hirotaka Susukida, Fei Ma, Mariusz Bajger	Automatic tuning of a graph-based image segmentation method for digital mammography applications.	ISBI	2008	DBLP DOI BibTeX RDF
1	Jiaxiang Lin, Dongyi Ye, Chongcheng Chen, Miaoxian Gao	Minimum Spanning Tree Based Spatial Outlier Mining and Its Applications.	RSKT	2008	DBLP DOI BibTeX RDF	Spatial outliers, MST Clustering, D-TIN, Outlier mining
1	Oren Ben-Zwi, Oded Lachish, Ilan Newman	Lower bounds for testing Euclidean Minimum Spanning Trees.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
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	Rajeev Kumar, Pramod Kumar Singh	On quality performance of heuristic and evolutionary algorithms for biobjective minimum spanning trees.	GECCO	2007	DBLP DOI BibTeX RDF	genetic algorithm, heuristics, combinatorial optimization, multiobjective optimization, spanning tree
1	Sören Laue, Domagoj Matijevic	Approximating k-hop Minimum Spanning Trees in Euclidean Metrics.	CCCG	2007	DBLP BibTeX RDF
1	Pawan Lingras, Rucha Lingras	Adaptive hyperlinks Using Page Access Sequences and Minimum Spanning Trees.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
1	Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski	Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.	SOFSEM	2007	DBLP DOI BibTeX RDF
1	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
1	Timothy M. Chan, Mihai Patrascu	Voronoi diagrams in n·2osqrt(lg lg n) time.	STOC	2007	DBLP DOI BibTeX RDF	segment intersection, word-RAM algorithms, computational geometry, sorting, convex hulls, point location
1	Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Alan S. Willsky	Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs.	CVPR	2007	DBLP DOI BibTeX RDF
1	Fei Ma, Mariusz Bajger, Murk J. Bottema	Robustness of Two Methods for Segmenting Salient Features in Screening Mammograms.	DICTA	2007	DBLP DOI BibTeX RDF
1	Ping Hu, Chenyi Hu	Fuzzy Partial-Order Relations for Intervals and Interval Weighted Graphs.	FOCI	2007	DBLP DOI BibTeX RDF
1	Zhiqiang Xie, Liang Yu, Jing Yang	A Clustering Algorithm Based on Improved Minimum Spanning Tree.	FSKD	2007	DBLP DOI BibTeX RDF
1	Michael Kaufmann	Polynomial Area Bounds for MST Embeddings of Trees.	Graph Drawing	2007	DBLP DOI BibTeX RDF
1	Deyu Zhou, Yulan He, Chee Keong Kwoh, Hao Wang	Ant-MST: An Ant-Based Minimum Spanning Tree for Gene Expression Data Clustering.	PRIB	2007	DBLP DOI BibTeX RDF	ant-based clustering, clustering, minimum spanning tree, gene expression data
1	Chung-Ming Lin, Yin-Te Tsai, Chuan Yi Tang	Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs.	Inf. Process. Lett.	2006	DBLP DOI BibTeX RDF
1	Michel X. Goemans, Jan Vondrák	Covering minimum spanning trees of random subgraphs.	Random Struct. Algorithms	2006	DBLP DOI BibTeX RDF
1	Renato M. Assunção, Marcos Corrêa Neves, Gilberto Câmara, Corina da Costa Freitas	Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees.	International Journal of Geographical Information Science	2006	DBLP DOI BibTeX RDF
1	James A. King	Realization of Degree 10 Minimum Spanning Trees in 3-Space.	CCCG	2006	DBLP 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	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	Timothy M. Chan	A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries.	SODA	2006	DBLP DOI BibTeX RDF
1	Ajit Rajwade, Arunava Banerjee, Anand Rangarajan	New Method of Probability Density Estimation with Application to Mutual Information Based Image Registration.	CVPR	2006	DBLP DOI BibTeX RDF
1	Dragomir Yankov, Eamonn J. Keogh	Manifold Clustering of Shapes.	ICDM	2006	DBLP DOI BibTeX RDF