"107 Algorithms for Sparse Graphs" - similar Books and Chapters

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Cohesive Subgraph Computation over Large Sparse Graphs: Algorithms, Data Structures, and Programming Techniques	Lijun Chang; Lu Qin	1st ed. 2018	Springer International Publishing
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
Algorithms for sparse Gaussian elimination with partial pivoting	Andrew H. Sherman	1976	Dept. of Computer Science, University of Illinois at Urbana-Champaign
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
Sparse Modeling: Theory, Algorithms, and Applications	Irina Rish; Genady Grabarnik	2014	Routledge
Analysis and Enumeration: Algorithms for Biological Graphs	Andrea Marino	2015	Atlantis Press
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
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
107 Algorithms for Sparse Graphs		Introduction to Parallel Computing	Ananth Grama; Anshul Gupta; George Karypis; Vipin Kumar	2003	Pearson
Optimal parallel algorithms for sparse graphs	Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis	Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG ' 90, Berlin, Germany, June 20-22, 1990	Rolf H. Möhring	1991	Springer Berlin Heidelberg
I/O-Efficient Algorithms for Sparse Graphs	Laura Toma; Norbert Zeh	Algorithms for Memory Hierarchies: Advanced Lectures	Ulrich Meyer; Peter Sanders; Jop Sibeyn	2003	Springer Berlin Heidelberg
Sparse Graphs		Graph Coloring Problems	Tommy R. Jensen	1994	John Wiley & Sons
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs	Michael T. Goodrich; Paweł Pszona	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
Extremal Problems for Sparse Graphs	Jaroslav NeŠetŘil; Patrice Ossona De Mendez	An Irregular Mind: Szemerédi is 70	Imre Bárány; Jozsef Solymosi	2010	Springer Berlin Heidelberg
Distance Oracles for Sparse Graphs	Liam Roditty	Encyclopedia of Algorithms	Ming-Yang Kao	2nd ed. 2016	Springer New York
Distance Oracles for Sparse Graphs	Liam Roditty	Encyclopedia of Algorithms	Ming-Yang Kao	0th ed. 2020	Springer Berlin Heidelberg
8 - Metrics for sparse graphs	B. Bollobás; O. Riordan	Surveys in Combinatorics 2009	Sophie Huczynska; James D. Mitchell; Colva M. Roney-Dougal	2009-07	Cambridge University Press
Large Deviations for Sparse Graphs	Sourav Chatterjee	Large Deviations for Random Graphs: École d' Été de Probabilités de Saint-Flour XLV - 2015	Sourav Chatterjee	1st ed. 2017	Springer International Publishing
Very Sparse Graphs	Joel Spencer	The Strange Logic of Random Graphs	Joel Spencer	2001	Springer Berlin Heidelberg
41 Sparse Graphs		STACS 2009: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, 26-28 February 2009 (Leibniz International Proceedings in Informatics - LIPIcs)	Susanne Albers, Jean-Yves Marion (eds.)		Schloss Dagstuhl - Leibniz-Zentrum fu r Informatik
Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs	Sergey Bereg	Discrete and Computational Geometry: Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004	Jin Akiyama; Mikio Kano; Xuehou Tan	2005	Springer Berlin Heidelberg
Matching Algorithms Are Fast in Sparse Random Graphs	Holger Bast; Kurt Mehlhorn; Guido Schäfer; Hisao Tamaki	STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings	Volker Diekert; Michel Habib	2004	Springer Berlin Heidelberg
Algorithms Based on the Treewidth of Sparse Graphs	Joachim Kneis; Daniel Mölle; Stefan Richter; Peter Rossmanith	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
Parallel Algorithms for Graphs	Frank Nielsen	Introduction to HPC with MPI for Data Science	Frank Nielsen	1st ed. 2016	Springer International Publishing
Local algorithms for graphs	David Gamarnik	Statistical Physics, Optimization, Inference, and Message-Passing Algorithms: Lecture Notes of the Les Houches School of Physics: Special Issue, October 2013	Florent Krzakala; Federico Ricci-Tersenghi; Lenka Zdeborova; Riccardo Zecchina; Eric W. Tramel; Leticia F. Cugliandolo	2015	Oxford University Press
Algorithms for Sparse Recovery Problems	Irina Rish; Genady Grabarnik	Sparse Modeling: Theory, Algorithms, and Applications	Irina Rish; Genady Grabarnik	2014	Routledge
Sparse matrix algorithms for SUPRENUM	J. Brehm; A. Böhm; Jens Volkert	CONPAR 90 - VAPP IV: Joint International Conference on Vector and Parallel Processing, Zurich, Switzerland, September 10-13, 1990. Proceedings	Helmar Burkhart	1990	Springer Berlin Heidelberg
Probabilistic algorithms for sparse polynomials	Richard Zippel	Symbolic and Algebraic Computation: Eurosam ' 79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, France, June 1979	E.W. Ng	1979	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries