Computing Blocker Sets for the Regular Post Embedding Problem

13 years 6 months ago

Download www.lsv.ens-cachan.fr

Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these languages and related decision problems.

Pierre Chambart, Philippe Schnoebelen

Real-time Traffic

DLT 2010 | Post Embedding Problem | Regular Languages | Related Decision Problems | Theoretical Computer Science |

claim paper

» Planar embeddability of the vertices of a graph using a fixed point set is NPhard

» Solving kSet Agreement with Stable Skeleton Graphs

» Constrained Clustering via Spectral Regularization

» Compatible triangulations and point partitions by seriestriangular graphs

» A sparsityinducing formulation for evolutionary coclustering

» Subspace Regularization A New Semisupervised Learning Method

» A CostRegular Based Hybrid Column Generation Approach

» Analysis and optimization of faulttolerant task scheduling on multiprocessor embedded syst...

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	DLT
Authors	Pierre Chambart, Philippe Schnoebelen

Comments (0)

Sciweavers

Computing Blocker Sets for the Regular Post Embedding Problem

DLT 2010 | Post Embedding Problem | Regular Languages | Related Decision Problems | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers