1605 search results - page 120 / 321 » On Partitional Labelings of Graphs |
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
COMBINATORICA
2006
13 years 10 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
RIVF
2003
14 years 4 days ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
ICPR
2004
IEEE
14 years 12 months ago
2004
IEEE
In this paper we present an image segmentation technique that fuses contributions from multiple feature subspaces using an energy minimization approach. For each subspace, we comp...