1605 search results - page 46 / 321 » On Partitional Labelings of Graphs |
JGT
2006
13 years 8 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
WG
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
EVOW
2006
Springer
14 years 10 days ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Interactive graph cuts are widely used in object segmentation but with some disadvantages: 1) Manual interactions may cause inaccurate or even incorrect segmentation results and i...
COLING
2000
13 years 10 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...