"Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Algorithms on graphs	H. T. Lau	1989	TAB Professional and Reference Books
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
Algorithms on Trees and Graphs	Gabriel Valiente	2002	Springer Berlin Heidelberg
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 and Data Structures for Massive Datasets	Dzejla Medjedovic, Emin Tahirovic	2021	Manning Publications
Algorithms and Data Structures for Massive Datasets	Dzejla Medjedovic, Emin Tahirovic	2022	Manning Publications
Algorithms and Data Structures for Massive Datasets	Dzejla Medjedovic, Emin Tahirovic	2022	Manning Publications Co.
Optimization algorithms for networks and graphs	Edward Minieka	1978	M. Dekker
Cutting plane algorithms for maximum problems	Siriphong Lawphongpanich	1991	Naval Postgraduate School;Available from National Technical Information Service
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity	Hans Jürgen Prömel; Angelika Steger	2002	Vieweg+Teubner Verlag
Algorithms for sparse Gaussian elimination with partial pivoting	Andrew H. Sherman	1976	Dept. of Computer Science, University of Illinois at Urbana-Champaign
Generalized Fibonacci maximum path graphs	Martin Charles Golumbic	1978	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
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
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs	Bharath Pattabiraman; Md. Mostofa Ali Patwary; Assefaw H. Gebremedhin; Wei-keng Liao; Alok Choudhary	Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings	Anthony Bonato; Michael Mitzenmacher; Pawel Pralat	2013	Springer International Publishing
An Efficient Local Search for the Maximum Clique Problem on Massive Graphs	Kazuho Kanahara; Tetsuya Oda; Elis Kulla; Akira Uejima; Kengo Katayama	Advances in Internet, Data & Web Technologies: The 10th International Conference on Emerging Internet, Data and Web Technologies (EIDWT-2022)	Leonard Barolli; Elis Kulla; Makoto Ikeda	1st ed. 2022	Springer International Publishing
Hard Graphs for the Maximum Clique Problem	Cornells Hoede	Graph Theory and Applications, Proceedings of the First Japan Conference on Graph Theory and Applications	J. Akiyama; Y. Egawa; H. Enomoto	1988	Elsevier
On CLIQUE Problem for Sparse Graphs of Large Dimension	Valentina Bykova; Roman Illarionov	Information Technologies and Mathematical Modelling: 13th International Scientific Conference, named after A. F. Terpugov, ITMM 2014, Anzhero-Sudzhensk, Russia, November 20-22, 2014. Proceedings	Alexander Dudin; Anatoly Nazarov; Rafael Yakupov; Alexander Gortsev	2014	Springer International Publishing
MAXIMUM CLIQUE PROBLEM		Algorithms Design and Analysis	Harsh Bhasin	2015	Oxford
The Maximum Clique Problem	Immanuel M. Bomze; Marco Budinich; Panos M. Pardalos; Marcello Pelillo	Handbook of Combinatorial Optimization: Supplement Volume A	Ding-Zhu Du; Panos M. Pardalos	1999	Springer US
Fast Winner-Takes-All Networks for the Maximum Clique Problem	Brijnesh J. Jain; Fritz Wysotzki	KI 2002: Advances in Artificial Intelligence: 25th Annual German Conference on AI, KI 2002, Aachen, Germany, September 16-20, 2002. Proceedings	Matthias Jarke; Jana Koehler; Gerhard Lakemeyer	2002	Springer Berlin Heidelberg
107 Algorithms for Sparse Graphs		Introduction to Parallel Computing	Ananth Grama; Anshul Gupta; George Karypis; Vipin Kumar	2003	Pearson
Fast algorithms for the dominating set problem on permutation graphs	Kuo-Hui Tsai; Wen-Lian Hsu	Algorithms: International Symposium SIGAL ' 90, Tokyo, Japan, August 16-18, 1990. Proceedings	Tetsuo Asano; Toshihide Ibaraki; Hiroshi Imai; Takao Nishizeki	1990	Springer Berlin Heidelberg
The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations	John D. Eblen; Charles A. Phillips; Gary L. Rogers; Michael A. Langston	Bioinformatics Research and Application: 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011, Proceedings	Jianer Chen; Jianxin Wang; Alexander Zelikovsky	2011	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
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)	Sen Huang; Mingyu Xiao; Xiaoyu Chen	Computing and Combinatorics: 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings	Chi-Yeh Chen; Wing-Kai Hon; Ling-Ju Hung; Chia-Wei Lee	1st ed. 2021	Springer International Publishing
Multithreaded Algorithms for Processing Massive Graphs	Kamesh Madduri; David A. Bader; Jonathan W. Berry; Joseph R. Crobak	Petascale Computing: Algorithms and Applications	David A. Bader	2007	Routledge
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
A Survey on Streaming Algorithms for Massive Graphs	Jian Zhang	Managing and Mining Graph Data	Charu C. Aggarwal; Haixun Wang	2010	Springer US
The Maximum Solution Problem on Graphs	Peter Jonsson; Gustav Nordh; Johan Thapper	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
Minimum-Risk Maximum Clique Problem	Maciej Rysz; Pavlo A. Krokhmal; Eduardo L. Pasiliao	Dynamics of Information Systems: Algorithmic Approaches	Alexey Sorokin; Panos M. Pardalos	2013	Springer New York
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)	Mathew C. Francis; Daniel Gonçalves; Pascal Ochem	Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers	Martin Charles Golumbic; Michael Stern; Avivit Levy; Gila Morgenstern	2012	Springer Berlin Heidelberg
On maximum clique problems in very large graphs	J. Abello, P. Pardalos and M. G. C. Resende	External memory algorithms: DIMACS Workshop External Memory and Visualization, May 20-22, 1998 /	Abello, James M.; Vitter, Jeffrey Scott,	[1999], ©1999.	American Mathematical Society,
Maximum Clique and Minimum Clique Partition in Visibility Graphs	Stephan Eidenbenz; Christoph Stamm	Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics: International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings	Jan Leeuwen; Osamu Watanabe; Masami Hagiya; Peter D. Mosses; Takayasu Ito	2000	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs" - similar Books and Chapters