Sciweavers

3211 search results - page 219 / 643
» On the Grundy Number of a Graph
Sort
View
DM
2006
121views more  DM 2006»
15 years 6 months ago
The acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
Alexandre Pinlou, Eric Sopena
JGT
2006
40views more  JGT 2006»
15 years 6 months ago
How many graphs are unions of k-cliques?
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(...
Béla Bollobás, Graham Brightwell
WG
2010
Springer
15 years 4 months ago
Graphs that Admit Right Angle Crossing Drawings
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 ...
Karin Arikushi, Radoslav Fulek, Balázs Kesz...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
16 years 19 days ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
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...
Jérémie Chalopin, Shantanu Das, Nico...
SCOPES
2004
Springer
15 years 12 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
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...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...