Sæther, Sigve Hortemo
- Between Treewidth and Clique-width
2014/04/30 by Sigve Hortemo Sæther, Jan Arne Telle, Sæther, Sigve Hortemo +1 · 2 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems
- Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
2014/11/21 by Sigve Hortemo Sæther, Sæther, Sigve Hortemo · 2 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
- Solving MaxSAT and #SAT on structured CNF formulas
2014/02/26 by Sigve Hortemo Sæther, Sæther, Sigve Hortemo, Jan Arne Telle +3 · 2 citations
Computer Science · #Advanced Graph Theory Research #Artificial Intelligence (cs.AI) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
- Maximum matching width: new characterizations and a fast algorithm for dominating set
2015/07/09 by Jeong, Jisu, Sæther, Sigve Hortemo, Telle, Jan Arne · 1 citation
#05C85 #68R10 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics