4913 search results - page 131 / 983 » Results and Perspectives of the G |
CGI
1998
IEEE
14 years 2 months ago
1998
IEEE
In this article we improve the butterfly and Loop's algorithm. As a result we obtain subdivision algorithms for triangular nets which can be used to generate G1- and G2surfac...
DM
2006
13 years 10 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
DAM
2000
13 years 10 months ago
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
RSA
2008
13 years 10 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
DPPI
2007
ACM
14 years 2 months ago
2007
ACM
Abstract. For many years, the HCI community has harbored a vision of interacting with intelligent, embodied computer agents. However, the reality of this vision remains elusive. Fr...