251 search results - page 50 / 51 » The Graphs with All Subgraphs T-Perfect |
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
IWCIA
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
COMSWARE
2007
IEEE
14 years 2 days ago
2007
IEEE
— VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-s...
AAAI
2006
13 years 7 months ago
2006
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
BMCBI
2008
13 years 5 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...