Sciweavers

1605 search results - page 81 / 321
» On Partitional Labelings of Graphs
Sort
View
ESOP
2009
Springer
14 years 4 months ago
Minimization Algorithm for Symbolic Bisimilarity
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
Filippo Bonchi, Ugo Montanari
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 2 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
FOCS
2004
IEEE
14 years 1 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 9 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
PODC
2006
ACM
14 years 3 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille