"Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs"

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
Connected Dominating Set: Theory and Applications	Ding-Zhu Du; Peng-Jun Wan	2013	Springer New York
Exact Exponential Algorithms	Fedor V. Fomin; Dieter Kratsch	2010	Springer Berlin Heidelberg
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
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
Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs	Chunmei Liu; Yinglei Song	Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings	Tetsuo Asano	2006	Springer Berlin Heidelberg
Exact Algorithms for Finding the Minimum Independent Dominating Set in Grap		Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006. Proceedings	Kazuo Iwama (auth.), Tetsuo Asano (eds.)	2006	Springer-Verlag Berlin Heidelberg
Exact Algorithms for Dominating Set	Dieter Kratsch	Encyclopedia of Algorithms	Ming-Yang Kao	2nd ed. 2016	Springer New York
Exact Algorithms for Dominating Set	Dieter Kratsch	Encyclopedia of Algorithms	Ming-Yang Kao	0th ed. 2020	Springer Berlin Heidelberg
Approximating the Minimum Independent Dominating Set in Perturbed Graphs	Weitian Tong; Randy Goebel; Guohui Lin	Computing and Combinatorics: 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, Proceedings	Ding-Zhu Du; Guochuan Zhang	2013	Springer Berlin Heidelberg
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs	Serge Gaspers; Mathieu Liedloff	Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers	Fedor V. Fomin	2006	Springer Berlin Heidelberg
On Minimum Independent Dominating Sets in Graphs	N. I. Glebov; A. V. Kostochka	Discrete Analysis and Operations Research	Alekseii D. Korshunov	1996	Springer Netherlands
Some Observations on Algorithms for Computing Minimum Independent Dominating Set	Anupama Potluri; Atul Negi	Contemporary Computing: 4th International Conference, IC3 2011, Noida, India, August 8-10, 2011. Proceedings	Srinivas Aluru; Sanghamitra Bandyopadhyay; Umit V. Catalyurek; Devdatt Dubhashi; Phillip H. Jones; Manish Parashar; Bertil Schmidt	2011	Springer Berlin Heidelberg
Exact (Exponential) Algorithms for the Dominating Set Problem	Fedor V. Fomin; Dieter Kratsch; Gerhard J. Woeginger	Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers	Juraj Hromkovič; Manfred Nagl; Bernhard Westfechtel	2005	Springer Berlin Heidelberg
Exact (Exponential) Algorithms for the Dominating Set Probl		Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers	Derek G. Corneil (auth.), Juraj Hromkovič, Manfred Nagl, Bernhard Westfechtel (eds.)	2005	Springer-Verlag Berlin Heidelberg
Exact Algorithms for Maximum Independent Set	Mingyu Xiao; Hiroshi Nagamochi	Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings	Leizhen Cai; Siu-Wing Cheng; Tak-Wah Lam	2013	Springer Berlin Heidelberg
Exact Algorithms for Maximum Independent Set	Fabrizio Grandoni	Encyclopedia of Algorithms	Ming-Yang Kao	2nd ed. 2016	Springer New York
Exact Algorithms for Maximum Independent Set	Fabrizio Grandoni	Encyclopedia of Algorithms	Ming-Yang Kao	0th ed. 2020	Springer Berlin Heidelberg
Fast Algorithms for min independent dominating set	Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos	Structural Information and Communication Complexity: 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings	Boaz Patt-Shamir; Tinaz Ekim	2010	Springer Berlin Heidelberg
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs	Mingyu Xiao	Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II	Weili Wu; Ovidiu Daescu	2010	Springer Berlin Heidelberg
Minimum Dominating Set		Optimization and approximation on systems of geometric objects	van Leeuwen E.	2009	CWI
Approximating Minimum Dominating Set on String Graphs	Dibyayan Chakraborty; Sandip Das; Joydeep Mukherjee	Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers	Ignasi Sau; Dimitrios M. Thilikos	1st ed. 2019	Springer International Publishing
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs	H. S. Chao; F. R. Hsu; R. C. T. Lee	Computing and Combinatorics: 4th Annual International Conference, COCOON’98, Taipei, Taiwan, R. o. C. , August 12–14, 1998	Wen-Lian Hsu; Ming-Yang Kao	1998	Springer Berlin Heidelberg
Minimum Connected Dominating Set		Optimization and approximation on systems of geometric objects	van Leeuwen E.	2009	CWI
Exact Algorithms for Dominating Clique Problems	N. Bourgeois; F. Della Croce; B. Escoffier; V. Th. Paschos	Algorithms and Computation: 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings	Ying Fei Dong; Ding-Zhu Du; Oscar H. Ibarra	2009	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs" - similar Books and Chapters