Cargando…
A Coding Method for Efficient Subgraph Querying on Vertex- and Edge-Labeled Graphs
Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NP-c...
Autores principales: | Zhu, Lei, Song, Qinbao, Guo, Yuchen, Du, Lei, Zhu, Xiaoyan, Wang, Guangtao |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4031119/ https://www.ncbi.nlm.nih.gov/pubmed/24853266 http://dx.doi.org/10.1371/journal.pone.0097178 |
Ejemplares similares
-
Vertex-deleted subgraphs and regular factors from regular graph()
por: Lu, Hongliang, et al.
Publicado: (2011) -
Graph Neural Network-Based Efficient Subgraph Embedding Method for Link Prediction in Mobile Edge Computing
por: Deng, Xiaolong, et al.
Publicado: (2023) -
DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries
por: Matelsky, Jordan K., et al.
Publicado: (2021) -
Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs
por: Soulé, Antoine, et al.
Publicado: (2021) -
Edge-colored directed subgraph enumeration on the connectome
por: Matejek, Brian, et al.
Publicado: (2022)