3204 search results - page 105 / 641 » The b-chromatic Number of a Graph |
CORR
2004
Springer
13 years 10 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
ALGORITHMICA
2000
13 years 10 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
EPIA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
STOC
1990
ACM
14 years 2 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
FORTE
1998
13 years 11 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...