3265 search results - page 46 / 653 » Representing Groups on Graphs |
101
Voted
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
121
Voted
DEXA
2004
Springer
15 years 9 months ago
2004
Springer
Much work has been done on characterizing the workload of a database system. Previous studies focused on providing different types of statistical summaries, and modeling the run-ti...
130
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
123
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
122
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...