We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) log_3(8) * k ~ 1.893 k. Note that mmw(G) 1.549 * mmw(G).publishedVersio
In the General Factor problem, we are given an undirected graph G and for each vertex v ∈ V(G) a fin...
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, a...
We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their ...
We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) log_3(8) * k...
We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) log_3(8) * k...
For nonempty ?, ? ? ?, a vertex set S in a graph G is a (?, ?)-dominating set if for all v ? S, |N(v...
In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast alg...
For nonempty σ, ρ ⊆ ℕ, a vertex set S in a graph G is a (σ, ρ)-dominating set if for all v ∈ S, |N(v...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast alg...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
We study the tractability of the maximum independent set problem from the viewpoint of graph width p...
We study the tractability of the maximum independent set problem from the viewpoint of graph width p...
AbstractWe design fast exponential time algorithms for some intractable graph-theoretic problems. Ou...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
In the General Factor problem, we are given an undirected graph G and for each vertex v ∈ V(G) a fin...
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, a...
We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their ...
We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) log_3(8) * k...
We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) log_3(8) * k...
For nonempty ?, ? ? ?, a vertex set S in a graph G is a (?, ?)-dominating set if for all v ? S, |N(v...
In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast alg...
For nonempty σ, ρ ⊆ ℕ, a vertex set S in a graph G is a (σ, ρ)-dominating set if for all v ∈ S, |N(v...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast alg...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
We study the tractability of the maximum independent set problem from the viewpoint of graph width p...
We study the tractability of the maximum independent set problem from the viewpoint of graph width p...
AbstractWe design fast exponential time algorithms for some intractable graph-theoretic problems. Ou...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
In the General Factor problem, we are given an undirected graph G and for each vertex v ∈ V(G) a fin...
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, a...
We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their ...
DOI
Add to ORKG