Detecting Communities by Suspecting the Maximum Degree Nodes

International Journal of Modern Physics B - Singapore
doi 10.1142/s0217979219501339
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Bounding the Maximum Likelihood Degree

Mathematical Research Letters
Mathematics
2015English

Planar Subgraphs Without Low-Degree Nodes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Trees With Given Maximum Degree Minimizing the Spectral Radius

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2016English

Coverage Degree in Mobile Nodes Wireless Sensor Network

2008English

The Independence Number in Graphs of Maximum Degree Three

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

Maximum Vertex and Face Degree of Oblique Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

The Distribution of the Maximum Vertex Degree in Random Planar Maps

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Expected Nodes: A Quality Function for the Detection of Link Communities

Studies in Computational Intelligence
Artificial Intelligence
2015English

Maximum Degree and Fractional Matchings in Uniform Hypergraphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1981English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy