3757 search results - page 263 / 752 » The overlap number of a graph |
126
click to vote
JGT
2006
15 years 6 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
166
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...
158
click to vote
WDAG
2007
Springer
16 years 21 days ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
219
click to vote
SCOPES
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
153
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...