Open AccessA Maximum Cardinality Cut Algorithm for Co-bipartite and Split Graphs Using Bimodular Decomposition
Author(s) -
Arman Boyacı,
Mordechai Shalom
Publication year - 2021
Publication title -
turkish journal of mathematics and computer science
Language(s) - English
Resource type - Journals
ISSN - 2148-1830
DOI - 10.47000/tjmcs.748563
Subject(s) - bipartite graph , treewidth , combinatorics , partial k tree , mathematics , chordal graph , 1 planar graph , modular decomposition , cardinality (data modeling) , bounded function , decomposition , pathwidth , discrete mathematics , complete bipartite graph , cograph , tree decomposition , graph , computer science , line graph , chemistry , mathematical analysis , data mining , organic chemistry
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom