"Fast algorithms for the dominating set problem on permutation 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
Fundamental Algorithms for Permutation Groups	Gregory Butler	1991	Springer Berlin Heidelberg
Permutation Group Algorithms	Ákos Seress	2003-03	Cambridge University Press
Algorithms on Trees and Graphs	Gabriel Valiente	2002	Springer Berlin Heidelberg
Graphs and Algorithms	Michel Gondran, Michel Minoux	1984	John Wiley & Sons
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
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity	Hans Jürgen Prömel; Angelika Steger	2002	Vieweg+Teubner Verlag
Coordinating pebble motion on graphs, the diameter of permutation groups and applications	D. M. Kornhauser	1984	Courant Institute of Mathematical Sciences, New York University
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
Fast Algorithms for 3D-Graphics	Georg Glaeser	1994	Springer New York
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 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
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 (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 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
On-line Dominating Set Problems for Graphs	Wen-Guey Tzeng	Handbook of Combinatorial Optimization	Ding-Zhu Du; Panos M. Pardalos	1998	Springer US
Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs	Charis Papadopoulos; Spyridon Tzimas	Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings	Ralf Klasing; Marc Zeitoun	1st ed. 2017	Springer Berlin Heidelberg
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
New Parameterized Algorithms for the Edge Dominating Set Problem	Mingyu Xiao; Ton Kloks; Sheung-Hung Poon	Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011, Proceedings	Filip Murlak; Piotr Sankowski	2011	Springer Berlin Heidelberg
Approximation Algorithms for Permanent Dominating Set Problem on Dynamic Networks	Subhrangsu Mandal; Arobinda Gupta	Distributed Computing and Internet Technology: 14th International Conference, ICDCIT 2018, Bhubaneswar, India, January 11–13, 2018, Proceedings	Atul Negi; Raj Bhatnagar; Laxmi Parida	1st ed. 2018	Springer International Publishing
Computational Study on Dominating Set Problem of Planar Graphs	Marjan Marzban; Qian-Ping Gu; Xiaohua Jia	Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John' s, NL, Canada, August 21-24, 2008, Proceedings	Boting Yang; Ding-Zhu Du; Cao An Wang	2008	Springer Berlin Heidelberg
Algorithms for Minimum m-Connected k-Dominating Set Problem	Weiping Shang; Frances Yao; Pengjun Wan; Xiaodong Hu	Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi' an, China, August 14-16, 2007, Proceedings	Andreas Dress; Yinfeng Xu; Binhai Zhu	2007	Springer Berlin Heidelberg
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier	Matt Gibson; Imran A. Pirwani	Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings	Mark de Berg; Ulrich Meyer	2010	Springer Berlin Heidelberg
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
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor	Shai Gutner	Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers	Jianer Chen; Fedor V. Fomin	2010	Springer Berlin Heidelberg
Algorithms on Graphs with Small Dominating Targe		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
Algorithms on Graphs with Small Dominating Targets	Divesh Aggarwal; Chandan K. Dubey; Shashank K. Mehta	Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings	Tetsuo Asano	2006	Springer Berlin Heidelberg
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
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
Dominating Set Theory and Algorithms	Jiguo Yu; Xiuzhen Cheng; Honglu Jiang; Dongxiao Yu	Hierarchical Topology Control for Wireless Networks: Theory, Algorithms, and Simulation	Jiguo Yu; Xiuzhen Cheng; Honglu Jiang; Dongxiao Yu	2017	Routledge
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Fast algorithms for the dominating set problem on permutation graphs" - similar Books and Chapters