Name
Abstract | ||
|---|---|---|
We study the computational complexity and approximability for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weights. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.endm.2016.10.009 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Graph partitioning,computational complexity,approximability | Strength of a graph,Discrete mathematics,Combinatorics,Circulant graph,Line graph,Loop (graph theory),Biconnected graph,Graph partition,Windmill graph,Butterfly graph,Mathematics | Journal |
Volume | ISSN | Citations |
55 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maurizio Bruglieri | 1 | 110 | 13.34 |
| Roberto Cordone | 2 | 310 | 28.87 |