197 search results - page 5 / 40 » Some Topological Methods in Graph Coloring Theory |
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
AEI
2008
13 years 7 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
3DPVT
2006
IEEE
13 years 11 months ago
2006
IEEE
The CSC (color structure code) is a robust and fast two dimensional segmentation method which has been already generalized to three dimensional images. As the CSC does not need an...
CW
2002
IEEE
14 years 10 days ago
2002
IEEE
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...