234 search results - page 27 / 47 » On Bus Graph Realizability |
NETWORKS
2008
13 years 7 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
TOOLS
2010
IEEE
14 years 7 days ago
2010
IEEE
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
DCG
2008
13 years 7 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
BMVC
2010
13 years 5 months ago
2010
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...