Sciweavers

2503 search results - page 220 / 501
» A study of 3-arc graphs
Sort
View
FCS
2009
15 years 4 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
ECEASST
2008
73views more  ECEASST 2008»
15 years 6 months ago
A Graph-Based Type Representation for Objects
Abstract: Subtyping and inheritance are two major issues in the research and development of object-oriented languages, which have been traditionally studied along the lines of type...
Cong-Cong Xing
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 6 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin
TAP
2008
Springer
102views Hardware» more  TAP 2008»
15 years 6 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell
EJC
2007
15 years 6 months ago
Hypertree width and related hypergraph invariants
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
Isolde Adler, Georg Gottlob, Martin Grohe