Size-fixed group discovery via multi-constrained graph pattern matching

DOI10.1016/J.INS.2024.121571MaRDI QIDQ6645059zbMATH OpenFDO

Authors Guliu Liu, Lei Li, Guanfeng Liu, Xindong Wu

Publication date 28 November 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.121571

zbMATH Keywords

fixed number of nodesgroup discoverymulti-constrained graph pattern matchingmulti-constrained optimal path selection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Effective and efficient community search with size constraint on bipartite graphs
• Method for subgraph matching with inclusion degree
• Utilizing constraint satisfaction techniques for efficient graph pattern matching
• Efficient pattern matching on big uncertain graphs
• Distributed top-k subgraph matching

Cites work

• An Algorithm for Subgraph Isomorphism
• scientific article; zbMATH DE number 1306878 (Why is no real title available?)
• Strong simulation: capturing topology in graph pattern matching

This page was built for publication: Size-fixed group discovery via multi-constrained graph pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645059)