Results 291 to 300 of about 27,298 (312)

On induced subgraphs of a block

Journal of Graph Theory, 1977
AbstractIf G is a block, then a vertex u of G is called critical if G ‐ u is not a block. In this article, relationships between the localization of critical vertices and the localization of vertices of relatively small degrees (especially, of degree two) are studied. A block is called semicritical if a) each edge is incident with at least one critical
openaire   +2 more sources

Subgraph Reconstruction via Reversible Subgraph Embedding

2023
Boyu Yang 0003, Weiguo Zheng
openaire   +1 more source

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  

Testing for Equivalence of Network Distribution Using Subgraph Counts

Journal of Computational and Graphical Statistics, 2020
Carey E Priebe
exaly  

The Dense k -Subgraph Problem

Algorithmica, 2001
U Feige, D Peleg
exaly  

Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs

Proceedings of the VLDB Endowment, 2015
Xuguang Ren, Junhu Wang, Volker Markl
exaly