Theoretical aspects of equitable partition of networks into sparse modules

DOI10.1016/J.TCS.2021.04.010MaRDI QIDQ2031046zbMATH OpenOpenAlexFDO

Authors Huaqiang Zhang, Xin Zhang

Publication date 8 June 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.04.010

zbMATH Keywords

complex networkdegenerate graphequitable partitionmaximum average degreeplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Partitioning networks based on generalized concepts of equivalence
• Community networks with equitable partitions
• Attributed Networks Partitioning Based on Modularity Optimization
• Optimal partition and effective dynamics of complex networks
• The optimal partitioning of networks
• Using graph partitioning for efficient network modularity optimization
• Asymptotic equipartition properties for simple hierarchical and networked structures
• Synchronization and equitable partitions in weighted networks

Cites work

• A conjecture on equitable vertex arboricity of graphs
• A list analogue of equitable coloring
• An optimal greedy heuristic to color interval graphs
• Complexity of tree-coloring interval graphs equitably
• Equitable coloring and the maximum degree
• Equitable d-degenerate Choosability of Graphs
• Equitable improper choosability of graphs
• Equitable list point arboricity of graphs
• Equitable list tree-coloring of bounded treewidth graphs
• Equitable partition of graphs into induced forests
• Equitable partition of graphs into induced linear forests
• Equitable partition of planar graphs
• Equitable partition of plane graphs with independent crossings into induced forests
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• Equitable vertex arboricity of 5-degenerate graphs
• Equitable vertex arboricity of graphs
• Equitable vertex arboricity of subcubic graphs
• Graph theory
• Hardness and algorithms of equitable tree-coloring problem in chordal graphs
• scientific article; zbMATH DE number 7225155 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• Tree-coloring problems of bounded treewidth graphs

Cited in

(6)

• Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
• Partitioning a PPI network into overlapping modules constrained by high-density and periphery tracking
• Partitioning networks based on generalized concepts of equivalence
• On equitable list arboricity of graphs
• Attributed Networks Partitioning Based on Modularity Optimization
• Equitable vertex arboricity of graphs with low maximum degree

This page was built for publication: Theoretical aspects of equitable partition of networks into sparse modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031046)