Finding a potential community in networks
DOI10.1016/J.TCS.2018.10.011zbMath1421.68064OpenAlexW2898526288WikidataQ129077865 ScholiaQ129077865MaRDI QIDQ1737592
Zsolt Tuza, Cristina Bazgan, Thomas Pontoizeau
Publication date: 23 April 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/105505/1/Bazgan-Pontoi-Tuza-Finding-a-potential-community.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Graph clustering
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Complement reducible graphs
- Optimization, approximation, and complexity classes
- Some simplified NP-complete graph problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Every planar map is four colorable. I: Discharging
- A partial k-arboretum of graphs with bounded treewidth
- Some APX-completeness results for cubic graphs
- A simple linear time algorithm for cograph recognition
- A Linear Recognition Algorithm for Cographs
- Efficient algorithms for interval graphs and circular-arc graphs
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- On Syntactic versus Computational Views of Approximability
- Triangles, 4-Cycles and Parameterized (In-)Tractability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding a potential community in networks
