Litcius/Paper detail

Finding densest <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e349" altimg="si11.svg"><mml:mi>k</mml:mi></mml:math>-connected subgraphs

Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis

2021Discrete Applied Mathematics17 citationsDOIOpen Access PDF

Topics & Concepts

CombinatoricsVertex (graph theory)MathematicsInduced subgraph isomorphism problemSubgraph isomorphism problemVertex connectivityGraph factorizationGraphTime complexityInduced subgraphEnhanced Data Rates for GSM EvolutionDiscrete mathematicsAlgorithmComputer scienceLine graphArtificial intelligenceGraph powerVoltage graphComplexity and Algorithms in GraphsAdvanced Graph Theory ResearchAdvanced Graph Neural Networks
Finding densest <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e349" altimg="si11.svg"><mml:mi>k</mml:mi></mml:math>-connected subgraphs | Litcius