Define the density d(G) of a graph G as e(G)/v(G) A polynomial algorithm for finding the densest subgraph of a graph is provided. Some results related to the density ofthe densest subgraph of a graph are obtained as w...Define the density d(G) of a graph G as e(G)/v(G) A polynomial algorithm for finding the densest subgraph of a graph is provided. Some results related to the density ofthe densest subgraph of a graph are obtained as well.展开更多
基金This research is supported by the National Natural Science Foundation of China under Grant No.10161008.Partially supported by the Natural Sciences Foundation of Inner Mongolia Autonomous Region(No.20000901-01)
文摘Define the density d(G) of a graph G as e(G)/v(G) A polynomial algorithm for finding the densest subgraph of a graph is provided. Some results related to the density ofthe densest subgraph of a graph are obtained as well.