"Algorithms for Graphs Embeddable with Few Crossings Per Edge"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Graphs and Algorithms	Michel Gondran, Michel Minoux	1984	John Wiley & Sons
Algorithms on graphs	H. T. Lau	1989	TAB Professional and Reference Books
Optimization algorithms for networks and graphs	Edward Minieka	1978	M. Dekker
Graphs, Networks and Algorithms	Dieter Jungnickel	4th ed. 2013	Springer Berlin Heidelberg
Graphs, Networks and Algorithms	Dieter Jungnickel	1999	Springer Berlin Heidelberg
Graphs: Theory and Algorithms	K. Thulasiraman	1992	John Wiley & Sons
Graphs, Algorithms, and Optimization	William Kocay; Donald L. Kreher	2016	Routledge
Algorithms Graphs and Computers	Richard Bellman; Kenneth L. Cooke; Jo Ann Lockett	1970	Elsevier
Graphs, Algorithms, and Optimization	Kocay, William; Kreher, Donald L	2017	Chapman and Hall/CRC
Graphs: Theory and Algorithms	Olga Moreira (Editor)	2020	Arcler Press
Graphs, Networks and Algorithms	Dieter Jungnickel	2nd ed. 2005	Springer Berlin Heidelberg
Graphs, Networks and Algorithms	Dieter Jungnickel	3rd ed. 2008	Springer Berlin Heidelberg
Graphs, networks, and algorithms	D. Jungnickel	1999	Springer
Analysis and Enumeration: Algorithms for Biological Graphs	Andrea Marino	2015	Atlantis Press
Neural network fundamentals with graphs, algorithms, and applications /	Bose, N. K.; Liang, Ping,	[1996], ©1996.	McGraw-Hill,
Algorithms on Trees and Graphs: With Python Code	Gabriel Valiente	2nd ed. 2021	Springer International Publishing
Sparsity: Graphs, Structures, and Algorithms	Jaroslav Nešetřil; Patrice Ossona de Mendez	2012	Springer Berlin Heidelberg
Algorithms on Trees and Graphs	Gabriel Valiente	2002	Springer Berlin Heidelberg
Dynamical Systems, Graphs, and Algorithms	George Osipenko	2007	Springer Berlin Heidelberg
Planar Graphs: Theory and Algorithms	T. Nishizeki; N. Chiba	1988	North-Holland
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
Algorithms for Graphs Embeddable with Few Crossings Per Edge	Alexander Grigoriev; Hans L. Bodlaender	Fundamentals of Computation Theory: 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings	Maciej Liskiewicz; Rüdiger Reischuk	2005	Springer Berlin Heidelberg
Graphs drawn with few crossings per edge	János Pach; Géza Tóth	Graph Drawing: Symposium on Graph Drawing GD' 96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings	Stephen North	1997	Springer Berlin Heidelberg
Configurations with Few Crossings in Topological Graphs	Christian Knauer; Étienne Schramm; Andreas Spillner; Alexander Wolff	Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings	Xiaotie Deng; Dingzhu Du	2005	Springer Berlin Heidelberg
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge	Michael Kaufmann	SOFSEM 2019: Theory and Practice of Computer Science: 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings	Barbara Catania; Rastislav Královič; Jerzy Nawrocki; Giovanni Pighizzini	1st ed. 2019	Springer International Publishing
Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge	Yunlong Liu; Jie Chen; Jingui Huang	Combinatorial Optimization and Applications: 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings	Weili Wu; Zhongnan Zhang	1st ed. 2020	Springer International Publishing
On Graphs Embeddable with Short Faces	R. Nedela; M. Skoviera	Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel	Rainer Bodendiek; Rudolf Henn	1990	Physica-Verlag HD
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge	Emilio Di Giacomo; Giuseppe Liotta; Francesco Trotta	Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers	Seok-Hee Hong; Takao Nishizeki; Wu Quan	2008	Springer Berlin Heidelberg
On 2-Embeddable Graphs	H. Schumacher	Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel	Rainer Bodendiek; Rudolf Henn	1990	Physica-Verlag HD
Square-Orthogonal Drawing with Few Bends per Edge	Yu-An Lin; Sheung-Hung Poon	Computing and Combinatorics: 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, Proceedings	Ding-Zhu Du; Guochuan Zhang	2013	Springer Berlin Heidelberg
Graphs with Few Eigenvalues	Andries E. Brouwer; Willem H. Haemers	Spectra of Graphs	Andries E. Brouwer; Willem H. Haemers	2012	Springer New York
Graphs with Edge Weights		Learning Algorithms: A Programmer's Guide to Writing Better Code	George Heineman	2021	O'Reilly Media
Graphs with Edge Information		Introduction to Graph Neural Networks	Zhiyuan Liu, Jie Zhou	2020	Morgan & Claypool
Algorithms for Finding Distance-Edge-Colorings of Graphs	Takehiro Ito; Akira Kato; Xiao Zhou; Takao Nishizeki	Computing and Combinatorics: 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings	Lusheng Wang	2005	Springer Berlin Heidelberg
Chapter 15 - Almost-embeddable graphs		Descriptive Complexity, Canonisation, and Definable Graph Structure Theory	Martin Grohe	2017-08	Cambridge University Press
Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs	Laurent Najman; Jean Cousty; Benjamin Perret	Mathematical Morphology and Its Applications to Signal and Image Processing: 11th International Symposium, ISMM 2013, Uppsala, Sweden, May 27-29, 2013, Proceedings	Cris L. Luengo Hendriks; Gunilla Borgefors; Robin Strand	2013	Springer Berlin Heidelberg
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs	Koichi Wada; Kimio Kawaguchi	Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ' 93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings	Jan Leeuwen	1994	Springer Berlin Heidelberg
Dynamic algorithms for graphs with treewidth		Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93 Utrecht, The Netherlands, June 16–18, 1993 Proceedings	Sotiris E. Nikoletseas, Paul G. Spirakis (auth.), Jan van Leeuwen (eds.)	1994	Springer-Verlag Berlin Heidelberg
Drawing Graphs with Right Angle Crossings	Walter Didimo; Peter Eades; Giuseppe Liotta	Algorithms and Data Structures: 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings	Frank Dehne; Jörg-Rüdiger Sack; Csaba D. Toth	2009	Springer Berlin Heidelberg
Fixed-Parameter Tractability for Book Drawing with Bounded Number of Crossings per Edge	Yunlong Liu; Yixuan Li; Jingui Huang	Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings	Weili Wu; Hongwei Du	1st ed. 2021	Springer International Publishing
Edge Graphs		Graph Theory	Ashay Dharwadker, Shariefuddin Pirzada	2011	CreateSpace
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Algorithms for Graphs Embeddable with Few Crossings Per Edge" - similar Books and Chapters