1545 search results - page 101 / 309 » On tree congestion of graphs |
FCT
2009
Springer
15 years 1 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
INFOVIS
2003
IEEE
15 years 3 months ago
2003
IEEE
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed ...
108
click to vote
AGTIVE
2003
Springer
15 years 3 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
159
click to vote
GC
2011
Springer
14 years 4 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...