"A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
A linear time algorithm for finding an ambitus.	B. Mishra	1989	Courant Institute of Mathematical Sciences, New York University
Planar Graphs: Theory and Algorithms	T. Nishizeki; N. Chiba	1988	North-Holland
On the determination of planar graphs	Chŏng-hwa Kim	1974	Naval Postgraduate School
Locally finite, planar, edge-transitive graphs	Jack E. Graver	1997	American Mathematical Society
A graph coloring algorithm and a scheduling problem	Robert Albert Draper	1971	U.S. Naval Postgraduate School
On optimal parallel algorithm for building a data structure for planar point location	Richard Cole	1987	Courant Institute of Mathematical Sciences, New York University
Beyond Planar Graphs: Communications of NII Shonan Meetings	Seok-Hee Hong; Takeshi Tokuyama	1st ed. 2020	Springer Nature Singapore
A geometric algorithm for solving the general linear programming problem.	James Thurber	1958	Courant Institute of Mathematical Sciences, New York University
The Lanczos algorithm for solving symmetric linear systems /	Simon, Horst.	1982.
Linear Graphs and Electrical Networks	Sundaram Seshu, Myril B. Reed	1961	Addison Wesley
Linear graphs and electrical networks	Seshu, Sundaram	1961	Addison-Wesley Pub. Co.
7 Algorithm Design Paradigms	Sung-Hyuk Cha
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
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
Graphs for Pattern Recognition: Infeasible Systems of Linear Inequalities	Damir Gainanov	2016	De Gruyter
A branch and bound algorithm for integer and mixed-integer linear programs	Joseph Bannan Missal	1969	Naval Postgraduate School
Convergence properties of an adaptive algorithm for linear threshold elements	Robert R. Pearson	1966	Naval Postgraduate School
A prototype for converting linear programming (LP) models to structured modeling graphs	David Steven Hill	1989	Naval Postgraduate School;Available from the National Technical Information Service
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 7-Coloring 1-Planar Graphs	Zhi-Zhong Chen; Mitsuharu Kouno	Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings	Branislav Rovan; Peter Vojtas	2003	Springer Berlin Heidelberg
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
Coloring of Planar Graphs		Introduction to graph theory	Douglas Brent West	2001	Prentice Hall
127 Coloring Planar Graphs		Mathematics for Computer Science	by Eric Lehman, F Thomson Leighton and Albert R Meyer
A linear-time algorithm for edge-disjoint paths in planar graphs	Dorothea Wagner; Karsten Weihe	Algorithms - ESA ' 93: First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993. Proceedings	Thomas Lengauer	1993	Springer Berlin Heidelberg
A linear-time algorithm for four-partitioning four-connected planar graphs	Shin-ichi Nakano; Md. Saidur Rahman; Takao Nishizeki	Graph Drawing: Symposium on Graph Drawing GD' 96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings	Stephen North	1997	Springer Berlin Heidelberg
A coloring algorithm for interval graphs	Maciej Slusarek	Mathematical Foundations of Computer Science 1989: Porabka-Kozubnik, Poland, August 28 - September 1, 1989. Proceedings	Antoni Kreczmar; Grazyna Mirkowska	1989	Springer Berlin Heidelberg
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs	Jian-Liang Wu; Ping Wang	Computational Science - ICCS 2007: 7th International Conference, Beijing China, May 27-30, 2007, Proceedings, Part III	Yong Shi; Geert Dick van Albada; Jack Dongarra; Peter M.A. Sloot	2007	Springer Berlin Heidelberg
93 Coloring of Planar Graphs		Combinatorial Mathematics	Douglas B. West	2020	Cambridge University Press
136 Coloring Planar Graphs 531		Mathematics for Computer Science	Eric Lehman, F Thomson Leighton, Albert R Meyer	2017
126 Coloring Planar Graphs 395		Discrete Mathematics for Computer Science	Eric Lehman, Thomson Leighton, Albert Meyer	2012
Linear Algorithm for 3-Coloring of Locally Connected Graphs	Martin Kochol	Experimental and Efficient Algorithms: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings	Klaus Jansen; Marian Margraf; Monaldo Mastrolilli; José D. P. Rolim	2003	Springer Berlin Heidelberg
Recognizing Outer 1-Planar Graphs in Linear Time	Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth et al.	Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers	Stephen Wismath; Alexander Wolff	2013	Springer International Publishing
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
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs	J. Czyzowicz; S. Dobrev; H. González-Aguilar; R. Kralovic; E. Kranakis; J. Opatrny et al.	Theory and Applications of Models of Computation: 5th International Conference, TAMC 2008, Xi' an, China, April 25-29, 2008, Proceedings	Manindra Agrawal; Ding-Zhu Du; Zhenhua Duan; Angsheng Li	2008	Springer Berlin Heidelberg
A linear time algorithm to recognize clustered planar graphs and its parallelization	Elias Dahlhaus	LATIN' 98: Theoretical Informatics: Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings	Claudio L. Lucchesi; Arnaldo V. Moura	1998	Springer Berlin Heidelberg
A Linear Time Algorithm for Determining Almost Bipartite Graphs	Dayu He; Xin He	Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings	Rahul Jain; Sanjay Jain; Frank Stephan	2015	Springer International Publishing
Planar and nonplanar graphs, coloring theorems		Finite graphs and networks: an introduction with applications	Robert G. Busacker, Thomas L. Saaty	1965	McGraw-Hill
7 - Planar Graphs		Graph Algorithms	Shimon Even; Guy Even	2011-09	Cambridge University Press
7 Planar graphs		Incidence and Symmetry in Design and Architecture	Jenny A. Baglivo, Jack E. Graver	1983	Cambridge University Press
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs" - similar Books and Chapters