Cograph

Results: 61



#Item
31Capturing Topology in Graph Pattern Matching Shuai Ma1 Yang Cao1 Wenfei Fan2 1 NLSDE Lab, Beihang University

Capturing Topology in Graph Pattern Matching Shuai Ma1 Yang Cao1 Wenfei Fan2 1 NLSDE Lab, Beihang University

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2011-12-25 09:36:22
32Hedonic Coalition Formation in Networks Martin Hoefer Daniel Vaz  Lisa Wagner

Hedonic Coalition Formation in Networks Martin Hoefer Daniel Vaz Lisa Wagner

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2014-11-19 07:33:23
33Common Pharmacophore Identification Using Frequent Clique Detection Algorithm Yevgeniy Podolyan and George Karypis University of Minnesota, Department of Computer Science and Computer Engineering Minneapolis, MN[removed]Oc

Common Pharmacophore Identification Using Frequent Clique Detection Algorithm Yevgeniy Podolyan and George Karypis University of Minnesota, Department of Computer Science and Computer Engineering Minneapolis, MN[removed]Oc

Add to Reading List

Source URL: www.dtc.umn.edu

Language: English - Date: 2012-08-16 12:29:06
34A SAT Approach to Clique-Width Marijn J. H. Heule1? and Stefan Szeider2?? 1 2

A SAT Approach to Clique-Width Marijn J. H. Heule1? and Stefan Szeider2?? 1 2

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2014-01-02 14:20:57
35Fast Construction of the Vietoris-Rips Complex Afra Zomorodian∗ (To appear in Computer & Graphics) 100

Fast Construction of the Vietoris-Rips Complex Afra Zomorodian∗ (To appear in Computer & Graphics) 100

Add to Reading List

Source URL: www.cs.dartmouth.edu

Language: English - Date: 2010-03-17 14:16:35
36Frequent Subgraph Discovery in Dynamic Networks Bianca Wackersreuther Peter Wackersreuther  Annahita Oswald

Frequent Subgraph Discovery in Dynamic Networks Bianca Wackersreuther Peter Wackersreuther Annahita Oswald

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2010-08-16 05:10:29
37Discriminative frequent subgraph mining with optimality guarantees Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Song‡

Discriminative frequent subgraph mining with optimality guarantees Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Song‡

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2010-07-07 07:38:39
38Near-optimal supervised feature selection among frequent subgraphs Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Songk

Near-optimal supervised feature selection among frequent subgraphs Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Songk

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2010-08-11 08:56:30
3920th International Workshop on Database and Expert Systems Application  Motif Discovery in Brain Networks of Patients with Somatoform Pain Disorder Annahita Oswald University of Munich

20th International Workshop on Database and Expert Systems Application Motif Discovery in Brain Networks of Patients with Somatoform Pain Disorder Annahita Oswald University of Munich

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2009-12-11 08:34:14
40Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1  Department of Computer Science, University of Toronto

Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1 Department of Computer Science, University of Toronto

Add to Reading List

Source URL: www.cs.utoronto.ca

Language: English - Date: 2008-04-30 14:20:20