Block Search DFS
max ind set on trees
max ind set on graphs of bounded blocks
max ind set on graphs of bounded tree-width
Theorem about tree-width and separator width, proof of the other inequality.
Complete quadratic time planarity algorithm
proof of the quadratic planarity testing algorithm
algorithm about tree-width of planar graphs:
PTAS for MinVertexCover problem on planar graphs, Baker’s technique
full proof
Theorem (approximating tree-width)
proof
Zuletzt geändertvor 19 Tagen
