
Computing Weighted Subset Transversals in HFree Graphs
For the Odd Cycle Transversal problem, the task is to find a small set S...
read it

Solutions for Subset Sum Problems with Special Digraph Constraints
The subset sum problem is one of the simplest and most fundamental NPha...
read it

Flip distances between graph orientations
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
read it

The 11 algorithm for Travelling Salesman Problem
The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilt...
read it

Discovering Bands from Graphs
Discovering the underlying structure of a given graph is one of the fund...
read it

A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem
The ecologist H. T. Odum introduced a principle of physics, called Maxim...
read it

Improvements in Suboptimal Solving of the (N^21)Puzzle via Joint Relocation of Pebbles and its Applications to Rulebased Cooperative PathFinding
The problem of solving (n^21)puzzle and cooperative pathfinding (CPF)...
read it
Finding a MaximumWeight Convex Set in a Chordal Graph
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless paths between any two vertices of the set. The problem is to find a maximumweight convex subset of a given vertexweighted chordal graph. It generalizes previously studied special cases in trees and split graphs. It also happens to be closely related to the closure problem in partially ordered sets and directed graphs. We give the first polynomialtime algorithm for the problem.
READ FULL TEXT
Comments
There are no comments yet.