Book
This treatise investigates a number of problems associated with the treewidth and pathwidth of graphs. The main object of the text is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of algorithmic graphs. «
Boeklezers.nl is a network for social reading. We help readers discover new books and authors, and bring readers in contact with each other and with writers. Read more ».
No related books yet.