Algorithms for recognition of regular properties and decomposition of recursive graph families R. BorieR. Gary ParkerC. A. Tovey Section III Graph-Theoretical Aspects Of TND Pages: 125 - 149
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds Endre BorosPeter L. Hammer Section III Graph-Theoretical Aspects Of TND Pages: 151 - 180
The image of weighted combinatorial problems P. M. CameriniG. GalbiatiF. Maffioli Section III Graph-Theoretical Aspects Of TND Pages: 181 - 197
Ancestor tree for arbitrary multi-terminal cut functions C. K. ChengT. C. Hu Section III Graph-Theoretical Aspects Of TND Pages: 199 - 213
Multiterminal xcut problems Refael Hassin Section III Graph-Theoretical Aspects Of TND Pages: 215 - 225
Some properties of graph centroids W. PiotrowskiM. M. Sysło Section III Graph-Theoretical Aspects Of TND Pages: 227 - 236