Back to Search
Start Over
Node-Balancing by Edge-Increments
- Source :
- Algorithms-ESA 2015 ISBN: 9783662483497, ESA
- Publication Year :
- 2015
- Publisher :
- Springer Berlin Heidelberg, 2015.
-
Abstract
- Suppose you are given a graph G = (V,E) with a weight assignment w:V → ℤ and that your objective is to modify w using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by 1.
- Subjects :
- Combinatorics
Discrete mathematics
Tutte theorem
Graph
Mathematics
Subjects
Details
- ISBN :
- 978-3-662-48349-7
- ISBNs :
- 9783662483497
- Database :
- OpenAIRE
- Journal :
- Algorithms-ESA 2015 ISBN: 9783662483497, ESA
- Accession number :
- edsair.doi...........160b50762b739b1dc1abd808bf96b08d
- Full Text :
- https://doi.org/10.1007/978-3-662-48350-3_38