The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase spanning tree (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1967-1975 (16) 1976-1982 (19) 1983-1985 (17) 1986-1988 (27) 1989 (17) 1990 (15) 1991 (16) 1992 (23) 1993 (21) 1994 (26) 1995 (36) 1996 (37) 1997 (43) 1998 (32) 1999 (44) 2000 (44) 2001 (62) 2002 (69) 2003 (89) 2004 (130) 2005 (156) 2006 (174) 2007 (183) 2008 (183) 2009 (164) 2010 (95) 2011 (66) 2012 (71) 2013 (74) 2014 (80) 2015 (85) 2016 (83) 2017 (80) 2018 (77) 2019 (14)
Publication types (Num. hits)
article(1001) book(1) incollection(18) inproceedings(1340) phdthesis(8)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1552 occurrences of 741 keywords

Results
Found 2368 publication records. Showing 2368 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
138Guojing Cong, David A. Bader The Euler Tour Technique and Parallel Rooted Spanning Tree. Search on Bibsonomy ICPP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF High-Performance Algorithm Engineering, Shared Memory, Spanning Tree, Parallel Graph Algorithms, Euler Tour
93Prabha Sharma Algorithms for the optimum communication spanning tree problem. Search on Bibsonomy Annals OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution
87Elena Prieto-Rodriguez, Christian Sloper Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
84Sergey Bereg, Minghui Jiang 0001, Boting Yang, Binhai Zhu On the Red/Blue Spanning Tree Problem. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
82Dae-Young Seo, D. T. Lee, Tien-Ching Lin Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
78Thang Nguyen Bui, Catherine M. Zrncic An ant-based algorithm for finding degree-constrained minimum spanning tree. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF degree constrained spanning tree, ant algorithm
78Refael Hassin, Asaf Levin Approximation Algorithms for Quickest Spanning Tree Problems. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms
78Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. Search on Bibsonomy ICCSA (3) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem
78Aref Meddeb Smart Spanning Tree Bridging for Metro Ethernets. Search on Bibsonomy LCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
74David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth Tight bounds for connecting sites across barriers. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2006 DBLP  DOI  BibTeX  RDF spanning trees, crossing number
73Hai Zhou, Narendra V. Shenoy, William Nicholls Efficient minimum spanning tree construction without Delaunay triangulation. Search on Bibsonomy ASP-DAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
72Martin Harrigan, Patrick Healy Efficiently drawing a significant spanning tree of a directed graph. Search on Bibsonomy APVIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
69Yury Nikulin Simulated annealing algorithm for the robust spanning tree problem. Search on Bibsonomy J. Heuristics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Robust spanning tree, Simulated annealing, Uncertainty
69Alok Singh 0001, Ashok Kumar Gupta Improved heuristics for the bounded-diameter minimum spanning tree problem. Search on Bibsonomy Soft Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm
69Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
69David A. Bader, Guojing Cong A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors. Search on Bibsonomy IPDPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
66Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. Search on Bibsonomy ISAAC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation algorithms, network design, spanning trees
62David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth Tight Bounds for Connecting Sites Across Barriers. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Spanning trees, Crossing number
60Baruch Awerbuch, Israel Cidon, Shay Kutten Optimal maintenance of a spanning tree. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF optimal message complexity, Distributed algorithms, spanning tree, leader election, dynamic networks, topological changes, amortized complexity
60Kazuhiro Suzuki A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Heterochromatic, Spanning tree, Edge-coloring, Rainbow, Multicolored
60Li-Jen Mao, Sheau-Dong Lang Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. Search on Bibsonomy ICPP Workshops The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal
60Seth Pettie, Vijaya Ramachandran An Optimal Minimum Spanning Tree Algorithm. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF optimal complexity, Graph algorithms, minimum spanning tree
60Seth Pettie, Vijaya Ramachandran Randomized minimum spanning tree algorithms using exponentially fewer random bits. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Graph algorithms, minimum spanning trees, random sampling
60Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. Search on Bibsonomy TAMC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
60Minh N. Doan An effective ant-based algorithm for the degree-constrained minimum spanning tree problem. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
60Refael Hassin, Asaf Levin Approximation Algorithms for Quickest Spanning Tree Problems. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
58Takeaki Uno An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. Search on Bibsonomy ISAAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF directed spanning tree, listing, enumerating algorithm
57Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. Search on Bibsonomy ISPAN The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
57Amaro F. de Sousa Improving Load Balance and Resilience of Ethernet Carrier Networks with IEEE 802.1S Multiple Spanning Tree Protocol. Search on Bibsonomy ICN/ICONS/MCL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
57Aili Han, Daming Zhu DNA Computing Model for the Minimum Spanning Tree Problem. Search on Bibsonomy SYNASC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
57Lisa Higham, Zhiying Liang Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. Search on Bibsonomy DISC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
57David Peleg, Eilon Reshef Deterministic Polylog Approximation for Minimum Communication Spanning Trees. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
56Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal 0001, Jack Snoeyink Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Minimum diameter spanning tree, Approximation algorithm, Geometric graph
56Seth Pettie An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. Search on Bibsonomy Combinatorica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C38, 68W01, 68R10
56Bryant A. Julstrom The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. Search on Bibsonomy GECCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF blob code, edge-sets, routing cost, codings, spanning trees
55Dimiter R. Avresky Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF single and multiple faults, Fault tolerance, reconfiguration, spanning trees, faulty hypercubes
55Stefan Voß Capacitated Minimum Spanning Trees. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Capacitated minimum spanning tree problem, Terminal layout problem, Resource-constrained minimum spanning tree problem, Combinatorial optimization, Telecommunication, Spanning tree
55José Elias Claudio Arroyo, Pedro Sampaio Vieira, Dalessandro Soares Vianna A GRASP algorithm for the multi-criteria minimum spanning tree problem. Search on Bibsonomy Annals OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF GRASP algorithm, Multi-criteria combinatorial optimization, Minimum spanning tree
55Dorabella Santos, Amaro de Sousa, Filipe Alvelos Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing. Search on Bibsonomy FITraMEn The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multiple spanning tree routing, integer programming, column generation
55Hirotsugu Kakugawa, Masafumi Yamashita A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. Search on Bibsonomy OPODIS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF ad-hoc network, self-stabilization, spanning tree, token circulation
54Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick On the Spanning Ratio of Gabriel Graphs and beta-skeletons. Search on Bibsonomy LATIN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
54Seth Pettie, Vijaya Ramachandran An optimal minimum spanning tree algorithm. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF optimal complexity, Graph algorithms, minimum spanning tree
54Sylvain Dahan, Jean-Marc Nicod, Laurent Philippe 0001 The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal. Search on Bibsonomy CCGRID The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
53Caetano Traina Jr., Agma J. M. Traina, Christos Faloutsos, Bernhard Seeger Fast Indexing and Visualization of Metric Data Sets using Slim-Trees. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF metric databases, similarity search, multimedia databases, index structures, selectivity estimation, metric access methods
53Sylvain Dahan, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe 0001 Performances Study of the Distributed Spanning Tree an Overlay Network for Server Lookup. Search on Bibsonomy ICIW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Distributed Spanning Tree, Simulations, Overlay networks
52Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam Improving Parallel Computation with Fast Integer Sorting. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Parallel algorithms, graph algorithms, minimum spanning tree, PRAM, integer sorting
51Andreas Darmann, Ulrich Pferschy, Joachim Schauer Determining a Minimum Spanning Tree with Disjunctive Constraints. Search on Bibsonomy ADT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF minimum spanning tree, conflict graph
51Huynh Thi Thanh Binh, Truong Binh Nguyen New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem. Search on Bibsonomy PRICAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF degree constrained minimum spanning tree, genetic algorithm, particle swarm optimization, swarm intelligent
51Qiang He, Chee-Hung Henry Chu A New Image Segmentation Technique Using Maximum Spanning Tree. Search on Bibsonomy IWCIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF affinity matrix, image segmentation, maximum spanning tree
51Petrica C. Pop On the prize-collecting generalized minimum spanning tree problem. Search on Bibsonomy Annals OR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Generalized minimum spanning tree problem, Combinatorial optimization, Minimum spanning trees, Linear relaxation
51Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro Distributed Computation of All Node Replacements of a Minimum Spanning Tree. Search on Bibsonomy Euro-Par The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Replacement Tree, Distributed Algorithms, Minimum Spanning Tree, Node Failure
51Guojing Cong, Simone Sbaraglia A Study on the Locality Behavior of Minimum Spanning Tree Algorithms. Search on Bibsonomy HiPC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF memory locality, graph algorithm, minimum spanning tree
51Hsueh-I Lu, R. Ravi 0001 A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Maximum-leaf spanning tree, Approximation algorithms, Performance guarantee, Approximation ratio
51Tzung-Shi Chen, Yu-Chee Tseng, Jang-Ping Sheu Balanced Spanning Trees in Complete and Incomplete Star Graphs. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Balanced spanning tree, personalized broadcast, interconnection network, parallel architecture, star graph
51Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé A Linear Vertex Kernel for Maximum Internal Spanning Tree. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
51Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis Self-stabilizing minimum-degree spanning tree within one from the optimal degree. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
51Xujin Chen, Jie Hu 0009, Xiaodong Hu The Minimum Risk Spanning Tree Problem. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
51Oleksandr Grygorash, Yan Zhou, Zach Jorgensen Minimum Spanning Tree Based Clustering Algorithms. Search on Bibsonomy ICTAI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
51Jiong Guo, Rolf Niedermeier, Sebastian Wernicke Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
51Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell The Minimum-Area Spanning Tree Problem. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
51Winfried Nöth, Reiner Kolla Spanning Tree-based State Encoding for Low Power Dissipation. Search on Bibsonomy DATE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
51R. Ravi 0001, Michel X. Goemans The Constrained Minimum Spanning Tree Problem (Extended Abstract). Search on Bibsonomy SWAT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
51Martin Fürer, Balaji Raghavachari Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
51Judit Bar-Ilan, Dror Zernik Random Leaders and Random Spanning Trees. Search on Bibsonomy WDAG The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
50Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg Labeling Schemes for Tree Representation. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Spanning tree, Labeling scheme, Tree representation
50Shantanu Das 0001, Beat Gfeller, Peter Widmayer Computing Best Swaps in Optimal Tree Spanners. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
50Feodor F. Dragan, Chenyu Yan, Yang Xiang Collective Additive Tree Spanners of Homogeneously Orderable Graphs. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Jingli Li, Manli Chen, Yonghong Xiang, Shaowen Yao Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees. Search on Bibsonomy NPC The full citation details ... 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
49Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger Backbone Colorings for Networks. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
48Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Search on Bibsonomy J. ACM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF 2-edge connectivity, connectivity, minimum spanning tree, dynamic graph algorithms, Biconnectivity
48Jana van Greunen, Jan M. Rabaey Lightweight time synchronization for sensor networks. Search on Bibsonomy Wireless Sensor Networks and Applications The full citation details ... 2003 DBLP  DOI  BibTeX  RDF synchronization, spanning tree, multi-hop, lightweight
48Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs. Search on Bibsonomy ICIC (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
48Zhiqiang Xie, Liang Yu, Jing Yang 0010 A Clustering Algorithm Based on Improved Minimum Spanning Tree. Search on Bibsonomy FSKD (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
47Luisa Gargano, Mikael Hammar There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Graph theory, Graph and network algorithms
47Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang Broadcasting on incomplete hypercubes. Search on Bibsonomy SPDP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
47Feodor F. Dragan, Martín Matamala Navigating in a Graph by Aid of Its Spanning Tree. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
47Narsingh Deo, Ayman M. Abdalla Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
47Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF multiple sequence alignment, evolutionary tree, minimal spanning tree
47Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Search on Bibsonomy IPCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
47Stavros D. Nikolopoulos, Charis Papadopoulos The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
46Yuval Emek k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
46Shaun Bangay, David de Bruyn, Kevin R. Glass Minimum spanning trees for valley and ridge characterization in digital elevation maps. Search on Bibsonomy Afrigraph The full citation details ... 2010 DBLP  DOI  BibTeX  RDF graph, minimum spanning tree, line, DEM, ridge
46Wolfgang Steitz, Franz Rothlauf Orientation matters: how to efficiently solve ocst problems with problem-specific EAs. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF optimal communications spanning tree, evolutionary algorithm, heuristics, recombination operators
46Carlo Gaibisso, Guido Proietti, Richard B. Tan Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Transient Node Failures, Radio Networks Survivability, Planar Graphs, Minimum Spanning Tree
45Tim Paulden, David K. Smith From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality. Search on Bibsonomy IEEE Trans. Evolutionary Computation The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Rajeev Kumar, Pramod Kumar Singh, P. P. Chakrabarti Improved Quality of Solutions for Multiobjective Spanning Tree Problem Using Distributed Evolutionary Algorithm. Search on Bibsonomy HiPC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Michel X. Goemans Minimum Bounded Degree Spanning Trees. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Mohammad Sohel Rahman, Abul Kashem Degree restricted spanning trees of graphs. Search on Bibsonomy SAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF algorithms, graphs, NP-completeness, spanning trees, Hamiltonian path
45Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki Spanning Trees Crossing Few Barriers. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
45Feodor F. Dragan, Chenyu Yan Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Akio Fujiyoshi Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata. Search on Bibsonomy CIAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Fangqing Gu, Hailin Liu, Wei Liu A bounded diameter minimum spanning tree evolutionary algorithm based on double chromosome. Search on Bibsonomy GEC Summit The full citation details ... 2009 DBLP  DOI  BibTeX  RDF double chromosome, the bounded diameter minimum spanning tree, evolutionary algorithm, local search
45Gustavo Bergantiños, Leticia Lorenzo Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems. Search on Bibsonomy Annals OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF cost spanning tree problem, optimality
44Hon Sun Chiu, Bin Wu 0002, Kwan Lawrence Yeung, King-Shan Lui Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks. Search on Bibsonomy WCNC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
44Yang Yang 0012, Mingen Lin, Jinhui Xu 0001, Yulai Xie Minimum Spanning Tree with Neighborhoods. Search on Bibsonomy AAIM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
44Jeremiah Nummela, Bryant A. Julstrom An effective genetic algorithm for the minimum-label spanning tree problem. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF labeled spanning trees, spanning subgraphs, genetic algorithms, local search, greedy heuristics
44Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff Facility Location and the Geometric Minimum-Diameter Spanning Tree. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
44Fumihiko Shimada, Hiroaki Ishii, Takeshi Itoh Spanning tree problem on a fuzzy network. Search on Bibsonomy KES (1) The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
44Frank Neumann 0001, Marco Laumanns Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
43Linzhong Liu, Ruichun He, Yinzhen Li The Fuzzy Weighted k-Cardinality Tree and Its Hybrid Genetic Algorithm. Search on Bibsonomy FSKD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF credibility measure, quadratic tree, genetic algorithm, Fuzzy set, spanning tree, k-tree
Displaying result #1 - #100 of 2368 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license