2 citations · 5 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 2 cited
Split-by-edges trees
Asbjørn Brændeland
A split-by-edges tree of a graph G on n vertices is a binary tree T where the root = V(G), every leaf is an independent set in G, and for every other node N in T with children L an…
cs.DS2015
Depth-first search in split-by-edges trees
Asbjørn Brændeland
A layerwise search in a split-by-edges tree (as defined by Brændeland, 2015) of agiven graph produces a maximum independent set in exponential time. A depth-first search produces a…