algorithm analysis and problem complexity

Walshaw, C. ORCID: https://orcid.org/0000-0003-0253-7779 (2001) A multilevel algorithm for force-directed graph drawing. In: Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings. Lecture Notes in Computer Science (1984). Springer Berlin Heidelberg, Berlin, Heidelberg, Germany, pp. 171-182. ISBN 9783540415541 ISSN 0302-9743 (doi:10.1007/3-540-44541-2_17)

combinatorics

Walshaw, C. ORCID: https://orcid.org/0000-0003-0253-7779 (2001) A multilevel algorithm for force-directed graph drawing. In: Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings. Lecture Notes in Computer Science (1984). Springer Berlin Heidelberg, Berlin, Heidelberg, Germany, pp. 171-182. ISBN 9783540415541 ISSN 0302-9743 (doi:10.1007/3-540-44541-2_17)

computer graphics

Walshaw, C. ORCID: https://orcid.org/0000-0003-0253-7779 (2001) A multilevel algorithm for force-directed graph drawing. In: Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings. Lecture Notes in Computer Science (1984). Springer Berlin Heidelberg, Berlin, Heidelberg, Germany, pp. 171-182. ISBN 9783540415541 ISSN 0302-9743 (doi:10.1007/3-540-44541-2_17)

discrete mathematics in computer science

Walshaw, C. ORCID: https://orcid.org/0000-0003-0253-7779 (2001) A multilevel algorithm for force-directed graph drawing. In: Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings. Lecture Notes in Computer Science (1984). Springer Berlin Heidelberg, Berlin, Heidelberg, Germany, pp. 171-182. ISBN 9783540415541 ISSN 0302-9743 (doi:10.1007/3-540-44541-2_17)