 | Up a level |
Pettersson, William and Sylvester, John 
ORCID: 0000-0002-6543-2934
(2023)
Bounds on the Twin-Width of Product Graphs.
Discrete Mathematics & Theoretical Computer Science, vol. 2 (Graph ).
Pettersson, William and Sylvester, John ORCID: 0000-0002-6543-2934
(2023)
Bounds on the Twin-Width of Product Graphs.
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 25 (1).
Enright, Jessica, Lee, Duncan, Meeks, Kitty, Pettersson, William and Sylvester, John ORCID: 0000-0002-6543-2934
(2021)
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation.
In:
Combinatorial Optimization and Applications.
Lecture Notes in Computer Science, 13135
.
Springer International Publishing, pp. 152-166.
ISBN 978-3-030-92680-9