Sciweavers

2314 search results - page 75 / 463
» Minimal Partitions of a Graph
Sort
View
LATIN
2000
Springer
15 years 4 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 5 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
WG
2004
Springer
15 years 6 months ago
Minimal de Bruijn Sequence in a Language with Forbidden Substrings
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
Eduardo Moreno, Martín Matamala
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 1 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
CVPR
2008
IEEE
15 years 7 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...