Cograph

Results: 61



#Item
11Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
12b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2014-02-09 09:55:11
13Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3

Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-02-26 04:11:59
14December 15, :16 WSPC - Proceedings Trim Size: 9.75in x 6.5in

December 15, :16 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2008-12-14 21:19:00
15Signing RDF Graphs Jeremy J. Carroll Digital Media Systems Laboratory HP Laboratories Bristol HPLJuly 23rd , 2003*

Signing RDF Graphs Jeremy J. Carroll Digital Media Systems Laboratory HP Laboratories Bristol HPLJuly 23rd , 2003*

Add to Reading List

Source URL: www.hpl.hp.com

Language: English - Date: 2003-09-05 13:21:53
16Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2

Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2

Add to Reading List

Source URL: www.francescobonchi.com

Language: English - Date: 2013-06-09 08:58:15
17BRICS  Basic Research in Computer Science ´ BRICS RSZ. Esik: Free De Morgan Bisemigroups and Bisemilattices

BRICS Basic Research in Computer Science ´ BRICS RSZ. Esik: Free De Morgan Bisemigroups and Bisemilattices

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2001-11-06 08:51:50
18Monotony Properties of Connected Visible Graph Searching Pierre Fraigniaud∗ Nicolas Nisse∗

Monotony Properties of Connected Visible Graph Searching Pierre Fraigniaud∗ Nicolas Nisse∗

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-01-17 10:04:51
19An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2013-02-11 10:36:14
20When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1

When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2012-06-17 02:27:41