"A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
An O(/E/loglog/V/) algorithm for finding minimum spanning trees	Andrew Chi-Chih Yao	1974	Dept. of Computer Science, University of Illinois at Urbana-Champaign
A linear time algorithm for finding an ambitus.	B. Mishra	1989	Courant Institute of Mathematical Sciences, New York University
A geometric algorithm for solving the general linear programming problem.	James Thurber	1958	Courant Institute of Mathematical Sciences, New York University
Piecewise-Linear Switching Surfaces for Minimum Time Control	Roy Henry Redderson	1966	Naval Postgraduate School;Available from National Technical Information Service
A Piecewise-Linear Switching Function For Quasi-Minimum-Time Control	Thomas Stephenson Althouse	1968	Naval Postgraduate School;Available from National Technical Information Service
The probabilistic minimum spanning tree problem: Part I--complexity and combinatorial properties	Dimitris Bertsimas	1988	Sloan School of Management, Massachusetts Institute of Technology
A new real-time algorithm for the two-dimensional convex hull problem	Edmond Schonberg	1981	Courant Institute of Mathematical Sciences, New York University
Optimizing for minimum response time in a linear system with limited control effort	James S. Demetry	1964	U.S. Naval Postgraduate School
The Lanczos algorithm for solving symmetric linear systems /	Simon, Horst.	1982.
An algorithm for the traveling salesman problem	John D. C. Little	1963	M.I.T.
A branch and exclude algorithm for the knapsack problem	Robert Lawrence Hegerich	1968	Naval Postgraduate School;Available from National Technical Information Service
Spectral Theory of Bounded Linear Operators	Carlos S. Kubrusly	1st ed. 2020	Springer International Publishing
Generalized Linear Models for Bounded and Limited Quantitative Variables	Michael Smithson; Yiyun Shou	September 2019	SAGE Publications, Inc
An implementation of the projective algorithm for linear programming	Guenter W. Bretschneider	1985
An algorithm for the solution of linear programming problems	Donald Leroy Sparks	1968	Naval Postgraduate School;Available from National Technical Information Service
A composite algorithm for the concave-cost LTL consolidation problem	Anantaram Balakrishnan	1985	Massachusetts Institute of Technology, Alfred P. Sloan School of Management
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	Naval Postgraduate School
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
Linear Graphs and Electrical Networks	Sundaram Seshu, Myril B. Reed	1961	Addison Wesley
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs	Michael J. Dinneen; Masoud Khosravani	Structural Information and Communication Complexity: 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings	Boaz Patt-Shamir; Tinaz Ekim	2010	Springer Berlin Heidelberg
Treewidth of treewidth-bounded graphs		Treewidth: Computations and Approximations	Ton Kloks	1994	Springer Berlin Heidelberg
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs	Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Ilan Newman; Oren Weimann	Internet and Network Economics: 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009, Proceedings	Stefano Leonardi	2009	Springer Berlin Heidelberg
Recognizing treewidth-bounded graphs		Treewidth: Computations and Approximations	Ton Kloks	1994	Springer Berlin Heidelberg
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees	Ran Duan; Haoqing He; Tianyi Zhang	LATIN 2020: Theoretical Informatics: 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings	Yoshiharu Kohayakawa; Flávio Keidi Miyazawa	1st ed. 2020	Springer International Publishing
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth	Dimitrios M. Thilikos; Maria J. Serna; Hans L. Bodlaender	Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings	Friedhelm Meyer auf der Heide	2001	Springer Berlin Heidelberg
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time	Daniel Meister	Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers	Dieter Kratsch	2005	Springer Berlin Heidelberg
The Minimum All-Ones Problem for Graphs with Small Treewidth	Yunting Lu; Yueping Li	Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi' an, China, August 14-16, 2007, Proceedings	Andreas Dress; Yinfeng Xu; Binhai Zhu	2007	Springer Berlin Heidelberg
A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem	Daniel A. M. Rocha; Elizabeth F. Gouvêa Goldbarg; Marco César Goldbarg	Evolutionary Computation in Combinatorial Optimization: 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings	Jens Gottlieb; Günther R. Raidl	2006	Springer Berlin Heidelberg
A Distributed Parallel Algorithm for the Minimum Spanning Tree Problem	Artem Mazeev; Alexander Semenov; Alexey Simonov	Parallel Computational Technologies: 11th International Conference, PCT 2017, Kazan, Russia, April 3–7, 2017, Revised Selected Papers	Leonid Sokolinsky; Mikhail Zymbler	1st ed. 2017	Springer International Publishing
Dynamic algorithms for graphs of bounded treewidth	Torben Hagerup	Automata, Languages and Programming: 24th International Colloquium, ICALP' 97, Bologna, Italy, July 7 - 11, 1997, Proceedings	Pierpaolo Degano; Roberto Gorrieri; Alberto Marchetti-Spaccamela	1997	Springer Berlin Heidelberg
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees	Torben Hagerup	Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers	Christophe Paul; Michel Habib	2010	Springer Berlin Heidelberg
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem	Attila Bernáth; Krzysztof Ciebiera; Piotr Godlewski; Piotr Sankowski	Experimental Algorithms: 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 -- July 1, 2014, Proceedings	Joachim Gudmundsson; Jyrki Katajainen	2014	Springer International Publishing
A linear time algorithm for isomorphism of graphs of bounded average genus	Jianer Chen	Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG ' 92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings	Ernst W. Mayr	1993	Springer Berlin Heidelberg
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs	David Fernández-Baca; Giora Slutzki	LATIN ' 95: Theoretical Informatics: Second Latin American Symposium, Valparaiso, Chile, April 3 - 7, 1995. Proceedings	Ricardo Baeza-Yates; Eric Goles; Patricio V. Poblete	1995	Springer Berlin Heidelberg
Only few graphs have bounded treewidth		Treewidth: Computations and Approximations	Ton Kloks	1994	Springer Berlin Heidelberg
Equitable Colorings of Bounded Treewidth Graphs	Hans L. Bodlaender; Fedor V. Fomin	Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings	Jirí Fiala; Václav Koubek; Jan Kratochvíl	2004	Springer Berlin Heidelberg
Kempe Changes in Bounded Treewidth Graphs	Marthe Bonamy; Vincent Delecroix; Clément Legrand-Duchesne	Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications	Jaroslav Nešetřil; Guillem Perarnau; Juanjo Rué; Oriol Serra	1st ed. 2021	Springer International Publishing
Replica Placement on Bounded Treewidth Graphs	Anshul Aggarwal; Venkatesan T. Chakaravarthy; Neelima Gupta; Yogish Sabharwal; Sachin Sharma; Sonika Thakral	Algorithms and Data Structures: 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings	Faith Ellen; Antonina Kolokolova; Jörg-Rüdiger Sack	1st ed. 2017	Springer International Publishing
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem	Jochen Könemann; Asaf Levin; Amitabh Sinha	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26, 2003	Sanjeev Arora; Klaus Jansen; Jose D.P. Rolim; Amit Sahai	2003	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs" - similar Books and Chapters