Results 151 to 160 of about 564 (166)

Efficient frequent connected subgraph mining in graphs of bounded tree-width

Theoretical Computer Science, 2010
The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a database, cannot be solved in output polynomial time in the general ...
Tamás Horvath, Jan Ramon
exaly   +6 more sources

Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width

Lecture Notes in Computer Science, 2013
. We study frequent connected induced subgraph mining, i.e., the problem of listing all connected graphs that are induced subgraph isomorphic to at least a certain number of transaction graphs.
Tamás Horvath, Keisuke Otaki, Jan Ramon   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Listing Dense Subgraphs in Small Memory

2014 9th Latin American Web Congress, 2014
Listing relevant patterns from graphs is becoming increasingly challenging as Web and social graphs are growing in size at a great rate. This scenario requires to process information more efficiently, including the need of processing data that cannot fit in main memory.
Patricio Pinto, Nataly Cruces, Cecilia Hernández   +2 more
openaire   +1 more source

Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs.

We show that, for every fixed positive integers r and k, Max-Weight List r-Colorable Induced Subgraph admits a polynomial-time algorithm on kP₃-free graphs. This problem is a common generalization of Max-Weight Independent Set, Odd Cycle Transversal and List r-Coloring, among others. Our result has several consequences.
Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi   +3 more
openaire   +2 more sources

A Survey on Subgraph Counting

ACM Computing Surveys, 2022
Pedro Ribeiro, Pedro Paredes, David Aparicio   +2 more
exaly  

A subgraph matching algorithm based on subgraph index for knowledge graph

Frontiers of Computer Science, 2021
Yunhao Sun, Guanyu Li, Bo Ning
exaly  

Fast subgraph query processing and subgraph matching via static and dynamic equivalences

VLDB Journal, 2022
Kunsoo Park, Xuemin Lin, Wook-Shin Han   +2 more
exaly  

On Directed Densest Subgraph Discovery

ACM Transactions on Database Systems, 2021
Chenhao Ma, Yixiang Fang, Reynold Cheng   +2 more
exaly  

Circinus: Fast Redundancy-Reduced Subgraph Matching

2023
Tatiana Jin, Boyang Li, Yichao Li
exaly  

Chapter 8 Listing Subgraphs

1988
openaire   +1 more source