Cograph

Results: 61



#Item
1Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang†  Abstract

Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-12-26 02:45:42
2Aachen Department of Computer Science Technical Report Better termination proving through cooperation

Aachen Department of Computer Science Technical Report Better termination proving through cooperation

Add to Reading List

Source URL: sunsite.informatik.rwth-aachen.de

Language: English - Date: 2013-04-14 08:37:31
3Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2014-07-12 10:24:09
4New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-03-14 00:55:15
5An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2008-11-30 14:19:38
6Mining chains of relations  ⋆ Foto Aftrati1 , Gautam Das2 , Aristides Gionis3 , Heikki Mannila4 , Taneli Mielik¨

Mining chains of relations ⋆ Foto Aftrati1 , Gautam Das2 , Aristides Gionis3 , Heikki Mannila4 , Taneli Mielik¨

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2013-06-24 04:26:19
7Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1

Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2012-06-12 14:31:34
8Better termination proving through cooperation Marc Brockschmidt1 , Byron Cook2,3 , and Carsten Fuhs3 1 2

Better termination proving through cooperation Marc Brockschmidt1 , Byron Cook2,3 , and Carsten Fuhs3 1 2

Add to Reading List

Source URL: www.dcs.bbk.ac.uk

Language: English - Date: 2013-04-13 17:39:03
9Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1  Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2013-01-07 10:28:15
10Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma†

Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma†

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:03