3204 search results - page 294 / 641 » The b-chromatic Number of a Graph |
106
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
86
Voted
DM
2000
15 years 27 days ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
113
Voted
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
107
Voted
IPL
2000
15 years 26 days ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
129
Voted
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...