491 search results - page 42 / 99 » On cyclically orientable graphs |
ISCC
2006
IEEE
14 years 2 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
DAM
2010
13 years 8 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
FAST
2009
13 years 6 months ago
2009
Provenance capture as applied to execution oriented and interactive workflows is designed to record minute detail needed to support a "modify and restart" paradigm as we...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
NCA
2007
IEEE
14 years 2 months ago
2007
IEEE
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...