Cited By
View all- Kim JLim SKim J(2022)OCSM : Finding overlapping cohesive subgraphs with minimum degreeInformation Sciences10.1016/j.ins.2022.06.020607(585-602)Online publication date: Aug-2022
The problem of enumerating connected induced subgraphs of a given graph is classical and studied well. It is known that connected induced subgraphs can be enumerated in constant time for each subgraph. In this paper, we focus on highly connected ...
The problem of enumerating all connected induced subgraphs of a given order k from a given graph arises in many practical applications: bioinformatics, information retrieval, processor design, to name a few. The upper bound on the ...
A graph is called H-free if it has no induced subgraph isomorphic to H. A graph is called $$N^i$$Ni-locally connected if $$G[\{ x\in V(G): 1\le d_G(w, x)\le i\}]$$G[{x?V(G):1≤dG(w,x)≤i}] is connected and $$N_2$$N2-locally connected if $$G[\{uv: \{uw, vw\...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in