"A linear algorithm for the maximal planar subgraph problem"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
An O(n log n) algorithm for the maximal planar subgraph problem.	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the maximal planar subgraph problem	Jiazhen Cai	1992	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
A linear time algorithm for finding an ambitus.	B. Mishra	1989	Courant Institute of Mathematical Sciences, New York University
On optimal parallel algorithm for building a data structure for planar point location	Richard Cole	1987	Courant Institute of Mathematical Sciences, New York University
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
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
An algorithm for generating ship schedules for a crisis deployment problem	Svein Buvik	1988
An algorithm for solving a range constrained traveling salesman problem	John William Harms	1976	Naval Postgraduate School
A graph coloring algorithm and a scheduling problem	Robert Albert Draper	1971	U.S. Naval Postgraduate School
Analysis of the motion-planning problem for a simple two-link planar arm	Boris Aronov	1987	Courant Institute of Mathematical Sciences, New York University
A branch and bound algorithm for integer and mixed-integer linear programs	Joseph Bannan Missal	1969	Naval Postgraduate School
Linear programming: an explanation of the simplex algorithm	Dakota Ulrich Greenwald	1957	Ronald Press Co.
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 algorithm for the maximal planar subgraph problem	Hristo N. Djidjev	Algorithms and Data Structures: 4th International Workshop, WADS ' 95, Kingston, Canada, August 16 - 18, 1995. Proceedings	Selim G. Akl; Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro	1995	Springer Berlin Heidelberg
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees	Wen-Lian Hsu	Computing and Combinatorics: 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings	Lusheng Wang	2005	Springer Berlin Heidelberg
A linear time algorithm for finding maximal planar subgraphs	Wen-Lian Hsu	Algorithms and Computations: 6th International Symposium, ISAAC ' 95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.	John Staples; Peter Eades; Naoki Katoh; Alistair Moffat	1995	Springer Berlin Heidelberg
Exact Algorithm for the Maximum Induced Planar Subgraph Problem	Fedor V. Fomin; Ioan Todinca; Yngve Villanger	Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings	Camil Demetrescu; Magnús M. Halldórsson	2011	Springer Berlin Heidelberg
A Linear Time Algorithm for the k Maximal Sums Problem	Gerth Stølting Brodal; Allan Grønlund Jørgensen	Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings	Ludek Kucera; Antonín Kucera	2007	Springer Berlin Heidelberg
A Note on the Practicality of Maximal Planar Subgraph Algorithms	Markus Chimani; Karsten Klein; Tilo Wiedera	Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers	Yifan Hu; Martin Nöllenburg	1st ed. 2016	Springer International Publishing
A Genetic Algorithm for the Maximal Clique Problem	Cristina Bazgan; Henri Luchian	Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference in Alès, France, 1995	David W. Pearson; Nigel C. Steele; Rudolf F. Albrecht	1995	Springer Vienna
The Spanning Maximal Planar Subgraph Problem for Some Classes of Complete 4-Partite Graphs	Tjaart Jan B. Estrada; Isagani B. Jos	Proceedings of the Seventh International Conference on Mathematics and Computing: ICMC 2021	Debasis Giri; Kim-Kwang Raymond Choo; Saminathan Ponnusamy; Weizhi Meng; Sedat Akleylek; Santi Prasad Maity	1st ed. 2022	Springer Nature Singapore
Maximum Planar Subgraph	Gruia Călinescu; Cristina G. Fernandes	Handbook of Approximation Algorithms and Metaheuristics: Contemporary and Emerging Applications	Teofilo F. Gonzalez	2018	Routledge
A linear algorithm for five-coloring a planar graph	N. Chiba; T. Nishizeki; N. Saito	Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings	N. Saito; T. Nishizeki	1981	Springer Berlin Heidelberg
A Parallel Algorithm for Subgraph Isomorphism	Vincenzo Carletti; Pasquale Foggia; Pierluigi Ritrovato; Mario Vento; Vincenzo Vigilante	Graph-Based Representations in Pattern Recognition: 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19–21, 2019, Proceedings	Donatello Conte; Jean-Yves Ramel; Pasquale Foggia	1st ed. 2019	Springer International Publishing
An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs	Yao Lu; Horst Bunke; Cheng-Lin Liu	Graph-Based Representations in Pattern Recognition: 9th IAPR-TC-15 International Workshop, GbRPR 2013, Vienna, Austria, May 15-17, 2013, Proceedings	Walter Kropatsch; Nicole M. Artner; Yll Haxhimusa; Xiaoyi Jiang	2013	Springer Berlin Heidelberg
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs	Sayaka Nagai; Shin-ichi Nakano	Graph-Theoretic Concepts in Computer Science: 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings	Ulrik Brandes; Dorothea Wagner	2000	Springer Berlin Heidelberg
A Linear Kernel for the Complementary Maximal Strip Recovery Problem	Haitao Jiang; Binhai Zhu	Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings	Juha Kärkkäinen; Jens Stoye	1st ed. 2012	Springer Berlin Heidelberg
Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs	Andrzej Lingas; Andrzej Proskurowski	Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. Proceedings	Kesav V. Nori	1987	Springer Berlin Heidelberg
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem	Markus Chimani; Ivo Hedtke; Tilo Wiedera	Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings	Veli Mäkinen; Simon J. Puglisi; Leena Salmela	1st ed. 2016	Springer International Publishing
a linear time algorithm for the arc disjoint Menger problem in planar directed graphs	Ulrik Brandes; Dorothea Wagner	Algorithms - ESA ' 97: 5th Annual European Symposium, Graz, Austria, September 15-17, 1997. Proceedings	Rainer Burkard; Gerhard Woeginger	1997	Springer Berlin Heidelberg
A Parallel Algorithm for Frequent Subgraph Mining	Bay Vo; Dang Nguyen; Thanh-Long Nguyen	Advanced Computational Methods for Knowledge Engineering: Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications - ICCSAMA 2015	Hoai An Le Thi; Ngoc Thanh Nguyen; Tien Van Do	2015	Springer International Publishing
Algorithm for a Maximum Induced Split Subgraph		Graph Theory, Computational Intelligence and Thought		2009	Springer
A New Parameterization Algorithm for the Linear Complementarity Problem	Sushil Verma; Peter A. Beling; Ilan Adler	Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems	Panos M. Pardalos	2000	Springer US
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A linear algorithm for the maximal planar subgraph problem" - similar Books and Chapters