175 search results - page 27 / 35 » max-cut and Containment Relations in Graphs |
SOFTVIS
2010
ACM
13 years 8 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
ECOOP
2001
Springer
14 years 1 months ago
2001
Springer
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
ICITA
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper presents an approach of using image contour recognition in the navigation for enterprise geographic information systems (GIS). The extraction of object mark images is b...
CACM
1998
13 years 8 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
DM
2002
13 years 8 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...