25 citations · 79 across the 15 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 3 cited
Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +1
A graph is -free for a pair of graphs if it contains no induced subgraph isomorphic to or . In 2001, Král', Kratochv\'ıl, Tuza, and Woeginger initia…
cs.DS2016★ 1 cited
A Serial Multilevel Hypergraph Partitioning Algorithm
Foad Lotfifar, Matthew Johnson
The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix…