#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2017

- This year (0)
- Last 5 years (15)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The linear maximum induced matching width (LMIM-width) of a graph is a width parameter based on the maximum induced matching in some of its subgraphs. In this paper we study output-polynomial… (More)

- Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
- Theor. Comput. Sci.
- 2014

Abstract Many NP -hard problems, such as Dominating Set , are FPT parameterized by clique-width. For graphs of clique-width k given with a k -expression, Dominating Set can be solved in 4 k n O ( 1 )… (More)

- Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
- J. Artif. Intell. Res.
- 2015

We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT. Tools from graph structure theory, in particular treewidth, have been used to successfully… (More)

- Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
- IPEC
- 2015

We give alternative definitions for maximum matching width, e.g. a graph $G$ has $\operatorname{mmw}(G) \leq k$ if and only if it is a subgraph of a chordal graph $H$ and for every maximal clique $X$… (More)

In this paper we propose a structural parameter of CNF formulas and use it to identify instances of weighted MaxSAT and #SAT that can be solved in polynomial time. Given a CNF formula we say that a… (More)

Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this… (More)

It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all… (More)

- Sigve Hortemo Sæther, Martin Vatshelle
- Theor. Comput. Sci.
- 2016

Many width parameters of graphs are defined using branch decompositions over the vertex set of the graph and a corresponding cut-function. In this paper, we give a general framework for showing… (More)

- Pinar Heggernes, Sigve Hortemo Sæther
- CSR
- 2012

A broadcast domination on a graph assigns an integer value f(u) ≥ 0 to each vertex u, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. The Broadcast… (More)

- Sigve Hortemo Sæther, Martin Vatshelle
- Electronic Notes in Discrete Mathematics
- 2015

Abstract Many width parameters of graphs are defined using branch decompositions over the vertex set of the graph and a corresponding cut-function. In this paper, we give a general framework for… (More)