Abstract: Community search is a problem that seeks cohesive and connected subgraphs in a graph that satisfy certain topology constraints, e.g., degree constraints. The majority of existing works focus ...
Abstract: Finding all simple paths and cycles in undirected graphs is a generic problem that covers a wide range of research areas. The problem has been discussed only to a minor extent in recent ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results