Search results for "cographs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon	b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.	Algorithmica	2015	DBLP DOI BibTeX RDF
21	Christopher Purcell, M. Puck Rombach	On the complexity of role colouring planar graphs, trees and cographs.	J. Discrete Algorithms	2015	DBLP DOI BibTeX RDF
21	Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang	On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs.	J. Discrete Algorithms	2015	DBLP DOI BibTeX RDF
21	Christophe Crespelle, Philippe Gambette	(Nearly-)tight bounds on the contiguity and linearity of cographs.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
21	Paul S. Bonsma	Independent Set Reconfiguration in Cographs.	CoRR	2014	DBLP BibTeX RDF
21	Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller	Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs.	CoRR	2014	DBLP BibTeX RDF
21	Marthe Bonamy, Nicolas Bousquet	Reconfiguring Independent Sets in Cographs.	CoRR	2014	DBLP BibTeX RDF
21	Christopher Purcell, M. Puck Rombach	On the Complexity of Role Colouring Planar Graphs, Trees and Cographs.	CoRR	2014	DBLP BibTeX RDF
21	Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra	Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660].	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
21	Elad Cohen, Martin Charles Golumbic, Bernard Ries	Characterizations of cographs as intersection graphs of paths on a grid.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
21	Paul Dorbec, Mickaël Montassier, Pascal Ochem	Vertex Partitions of Graphs into Cographs and Stars.	J. Graph Theory	2014	DBLP DOI BibTeX RDF
21	Paul S. Bonsma	Independent Set Reconfiguration in Cographs.	WG	2014	DBLP DOI BibTeX RDF
21	Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon	b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs.	ISCO	2014	DBLP DOI BibTeX RDF
21	Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe	Probe interval graphs and probe unit interval graphs on superclasses of cographs.	Discret. Math. Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
21	Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	Cycle transversals in perfect graphs and cographs.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
21	Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23].	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
21	Ton Kloks, Yue-Li Wang	On retracts and folds in cographs	CoRR	2013	DBLP BibTeX RDF
21	Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang	Independent set in categorical products of cographs and splitgraphs	CoRR	2013	DBLP BibTeX RDF
21	Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs.	CoRR	2013	DBLP BibTeX RDF
21	Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier	Algorithmic Aspects of Switch Cographs.	CoRR	2013	DBLP BibTeX RDF
21	Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.	Discret. Math. Algorithms Appl.	2013	DBLP DOI BibTeX RDF
21	Yong Gao 0001, Donovan R. Hare, James Nastos	The cluster deletion problem for cographs.	Discret. Math.	2013	DBLP DOI BibTeX RDF
21	Christophe Crespelle, Philippe Gambette	Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs.	WALCOM	2013	DBLP DOI BibTeX RDF
21	Ton Kloks, Yue-Li Wang	On Retracts, Absolute Retracts, and Folds in Cographs.	WG	2013	DBLP DOI BibTeX RDF
21	Ji Li	Combinatorial Logarithm and Point-Determining Cographs.	Electron. J. Comb.	2012	DBLP DOI BibTeX RDF
21	Katarzyna Jesse-Józefczyk	The possible cardinalities of global secure sets in cographs.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
21	Ton Kloks	A note on probe cographs	CoRR	2012	DBLP BibTeX RDF
21	Petr A. Golovach, Pinar Heggernes, Rodica Mihai	Edge search number of cographs.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
21	Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.	WALCOM	2012	DBLP DOI BibTeX RDF
21	Jean-François Couturier 0001, Pinar Heggernes, Pim van 't Hof, Yngve Villanger	Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.	COCOON	2012	DBLP DOI BibTeX RDF
21	Guillermo Durán, Luciano N. Grippo, Martín Darío Safe	Probe interval and probe unit interval graphs on superclasses of cographs.	Electron. Notes Discret. Math.	2011	DBLP DOI BibTeX RDF
21	Ling-Ju Hung, Ton Kloks	k-Cographs are Kruskalian.	Chic. J. Theor. Comput. Sci.	2011	DBLP BibTeX RDF
21	Ruo-Wei Hung, Chih-Chia Yao	Linear-time algorithm for the matched-domination problem in cographs.	Int. J. Comput. Math.	2011	DBLP DOI BibTeX RDF
21	Sun-Yuan Hsieh	On parallel recognition of cographs.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
21	Andrew Lyons	Acyclic and Star Colorings of Cographs	CoRR	2011	DBLP BibTeX RDF
21	Ton Kloks, Chin-Ting Ung, Yue-Li Wang	On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs	CoRR	2011	DBLP BibTeX RDF
21	Türker Bíyíkoglu, Slobodan K. Simic, Zoran Stanic	Some Notes On Spectra Of Cographs.	Ars Comb.	2011	DBLP BibTeX RDF
21	Andrew Lyons	Acyclic and star colorings of cographs.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
21	Maria Chroni, Stavros D. Nikolopoulos	Encoding watermark numbers as cographs using self-inverting permutations.	CompSysTech	2011	DBLP DOI BibTeX RDF
21	Oleg V. Zubkov, Dmitry V. Chistikov, Andrey A. Voronenko	An Upper Bound on Checking Test Complexity for Almost All Cographs.	SYNASC	2011	DBLP DOI BibTeX RDF
21	B. S. Panda 0001, Dinabandhu Pradhan	Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
21	John Gimbel, Jaroslav Nesetril	Partitions of graphs into cographs.	Discret. Math.	2010	DBLP DOI BibTeX RDF
21	Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon	On the b-Coloring of Cographs and P4-Sparse Graphs.	Graphs Comb.	2009	DBLP DOI BibTeX RDF
21	Stavros D. Nikolopoulos, Charis Papadopoulos	Counting Spanning Trees in Cographs: An Algorithmic Approach.	Ars Comb.	2009	DBLP BibTeX RDF
21	Andrew Lyons	Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs.	CTW	2009	DBLP BibTeX RDF
21	Torsten Sander	On Certain Eigenspaces of Cographs.	Electron. J. Comb.	2008	DBLP BibTeX RDF
21	Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra	Polar cographs.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
21	Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra	Polar cographs.	Electron. Notes Discret. Math.	2007	DBLP DOI BibTeX RDF
21	Sun-Yuan Hsieh	A faster parallel connectivity algorithm on cographs.	Appl. Math. Lett.	2007	DBLP DOI BibTeX RDF
21	Katerina Asdre, Stavros D. Nikolopoulos	A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs.	Networks	2007	DBLP DOI BibTeX RDF
21	Van Bang Le, H. N. de Ridder	Linear-time certifying recognition for partitioned probe cographs.	Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes	2007	DBLP BibTeX RDF
21	Martin Charles Golumbic, Aviad Mintz, Udi Rotics	Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
21	Christophe Crespelle, Christophe Paul	Fully dynamic recognition algorithm and certificate for directed cographs.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
21	Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira	Characterizing (k, l)-partitionable Cographs.	Electron. Notes Discret. Math.	2005	DBLP DOI BibTeX RDF
21	Veeraraghavan Prakash	An efficient g-centroid location algorithm for cographs.	Int. J. Math. Math. Sci.	2005	DBLP DOI BibTeX RDF
21	Stavros D. Nikolopoulos, Leonidas Palios	Efficient parallel recognition of cographs.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
21	Marc Demange, Tínaz Ekim, Dominique de Werra	Partitioning cographs into cliques and stable sets.	Discret. Optim.	2005	DBLP DOI BibTeX RDF
21	Anna Bretscher	LexBFS based recognition algorithms for cographs and related families.		2005	RDF
21	Ron Shamir, Roded Sharan	A fully dynamic algorithm for modular decomposition and recognition of cographs.	Discret. Appl. Math.	2004	DBLP DOI BibTeX RDF
21	Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña	The clique operator on cographs and serial graphs.	Discret. Math.	2004	DBLP DOI BibTeX RDF
21	Stavros D. Nikolopoulos, Charis Papadopoulos	Counting Spanning Trees in Cographs.	Electron. Notes Discret. Math.	2003	DBLP DOI BibTeX RDF
21	Koji Nakano, Stephan Olariu, Albert Y. Zomaya	A time-optimal solution for the path cover problem on cographs.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
21	Christian Retoré	Handsome proof-nets: perfect matchings and cographs.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
21	Vassilis Giakoumakis, Jean-Marie Vanherpe	Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs.	Int. J. Found. Comput. Sci.	2003	DBLP DOI BibTeX RDF
21	John Gimbel, Jaroslav Nesetril	Partitions of Graphs into Cographs.	Electron. Notes Discret. Math.	2002	DBLP DOI BibTeX RDF
21	Vlady Ravelomanana, Loÿs Thimonier	Asymptotic enumeration of cographs.	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
21	Guillaume Damiand, Michel Habib, Christophe Paul	A simple paradigm for graph recognition: application to cographs and distance hereditary graphs.	Theor. Comput. Sci.	2001	DBLP DOI BibTeX RDF
21	Martin Charles Golumbic, Aviad Mintz, Udi Rotics	Factoring and Recognition of Read-Once Functions using Cographs and Normality.	DAC	2001	DBLP DOI BibTeX RDF
21	Stavros D. Nikolopoulos	Recognizing cographs and threshold graphs through a classification of their edges.	Inf. Process. Lett.	2000	DBLP DOI BibTeX RDF
21	Terry A. McKee	Dimensions for Cographs.	Ars Comb.	2000	DBLP BibTeX RDF
21	William C. K. Yen, C. Y. Tang	The searchlight guarding problem on weighted split graphs and weighted cographs.	Networks	2000	DBLP DOI BibTeX RDF
21	Chuan-Ming Liu, Ming-Shing Yu	An Optimal Parallel Algorithm for Node Ranking of Cographs.	Discret. Appl. Math.	1998	DBLP DOI BibTeX RDF
21	David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan	Partial and Perfect Path Covers of Cographs.	Discret. Appl. Math.	1998	DBLP DOI BibTeX RDF
21	Elias Dahlhaus	Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs.	Discret. Appl. Math.	1995	DBLP DOI BibTeX RDF
21	Rong Lin, Stephan Olariu	An Optimal Parallel Matching Algorithm for Cographs.	J. Parallel Distributed Comput.	1994	DBLP DOI BibTeX RDF
21	Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang	An Efficient Erew Algorithm for Minimum Path Cover and Hamiltonicity on Cographs.	Parallel Algorithms Appl.	1994	DBLP DOI BibTeX RDF
21	Ming-Shing Yu, Cheng-Hsing Yang	An O(n) Time Algorithm for Maximum Matching on Cographs.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
21	Ming-Shing Yu, Cheng-Hsing Yang	A Linear Time Algorithm for the Maximum Matching Problem on Cographs.	BIT	1993	DBLP DOI BibTeX RDF
21	Hans L. Bodlaender, Rolf H. Möhring	The Pathwidth and Treewidth of Cographs.	SIAM J. Discret. Math.	1993	DBLP DOI BibTeX RDF
21	Rong Lin, Stephan Olariu	An NC Recognition Algorithm for Cographs.	J. Parallel Distributed Comput.	1991	DBLP DOI BibTeX RDF
21	Rong Lin, Stephan Olariu	A Fast Parallel Algorithm to Compute Path Functions for Cographs.	ICPP (3)	1991	DBLP BibTeX RDF
21	Gur Saran Adhar, Shietung Peng	Parallel Algorithms for Cographs and Parity Graphs with Applications.	J. Algorithms	1990	DBLP DOI BibTeX RDF
21	Hans L. Bodlaender, Rolf H. Möhring	The Pathwidth and Treewidth of Cographs.	SWAT	1990	DBLP DOI BibTeX RDF
21	Gur Saran Adhar, Shietung Peng	Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs.	ICPP (3)	1990	DBLP BibTeX RDF
21	Hans L. Bodlaender	Achromatic Number is NP-Complete for Cographs and Interval Graphs.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
21	Gottfried Tinhofer	Strong tree-cographs are birkhoff graphs.	Discret. Appl. Math.	1989	DBLP DOI BibTeX RDF
21	Gur Saran Adhar, Shietung Peng	Parallel Algorithms for Cographs Recognition and Applications.	WADS	1989	DBLP DOI BibTeX RDF
21	Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart	A Linear Recognition Algorithm for Cographs.	SIAM J. Comput.	1985	DBLP DOI BibTeX RDF
17	Petr A. Golovach, Pinar Heggernes	Choosability of P5-Free Graphs.	MFCS	2009	DBLP DOI BibTeX RDF
17	Tínaz Ekim, Pinar Heggernes, Daniel Meister 0001	Polar Permutation Graphs.	IWOCA	2009	DBLP DOI BibTeX RDF
17	Richard B. Borie, R. Gary Parker, Craig A. Tovey	Solving problems on recursively constructed graphs.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
17	Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca	Independent Sets of Maximum Weight in Apple-Free Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
17	Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng	Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.	ICIC (2)	2008	DBLP DOI BibTeX RDF
17	Pinar Heggernes, Dieter Kratsch, Daniel Meister 0001	Bandwidth of Bipartite Permutation Graphs in Polynomial Time.	LATIN	2008	DBLP DOI BibTeX RDF
17	Sun-Yuan Hsieh	An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	The perfect domination problem, Parallel algorithms, Parallel random access machine (PRAM), Distance-hereditary graphs
17	Marc Tedder, Derek G. Corneil	An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs.	STACS	2007	DBLP DOI BibTeX RDF	graph recognition, distance-hereditary, dynamic algorithm, cograph
17	Robin Nunkesser, Philipp Woelfel	Representation of Graphs by OBDDs.	ISAAC	2005	DBLP DOI BibTeX RDF
17	Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng	On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.	COCOON	2005	DBLP DOI BibTeX RDF
17	Gerard J. Chang, Chiuyuan Chen, Yaping Chen	Vertex and Tree Arboricities of Graphs.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth
17	Michael U. Gerber, Vadim V. Lozin	Robust Algorithms for the Stable Set Problem.	Graphs Comb.	2003	DBLP DOI BibTeX RDF	Stable set, Stability number, Polynomial algorithm