Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width
ECML/PKDD, 2013 T. Horváth, Keisuke Otaki, J. Ramon
semanticscholar +1 more source
Orthology and near-cographs in the context of phylogenetic networks. [PDF]
Algorithms Mol BiolLindeberg A +3 more
europepmc +1 more source
Generating All Maximal Induced Subgraphs for Hereditary, Connected-Hereditary and Rooted-Hereditary Properties [PDF]
, 2004 Sara Cohen, Yehoshua Sagiv
openalex +1 more source
OFGPMA: Optimal frequency graph representation learning for pseudogene and miRNA association prediction. [PDF]
Front GenetZeng Y, Xiong L, Luo Y.
europepmc +1 more source
Induced Subgraph Density. I. A loglog Step Towards Erds–Hajnal [PDF]
Matija Bucić +3 more
openalex +1 more source
Induced subgraph isomorphism: Are some patterns substantially easier than others?
Theoretical Computer Science, 2012 Peter Floderus +3 more
semanticscholar +1 more source
Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]
Front Comput NeurosciWang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc +1 more source
Network design for bypass roads using interval valued fuzzy outerplanar graphs. [PDF]
Sci RepJaisankar D +3 more
europepmc +1 more source
The Enumeration of Vertex Induced Subgraphs with respect to the Number of Components [PDF]
, 2008 Peter Tittmann +2 more
openalex +1 more source
Polyhedral study of the maximum common induced subgraph problem
Annals of Operations Research, 2011 Breno Piva, C. C. Souza
semanticscholar +1 more source