2283 search results - page 102 / 457 » Bounds of Graph Characteristics |
AUTOMATICA
2004
13 years 8 months ago
2004
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
COMBINATORICS
2006
13 years 8 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
DM
2006
13 years 8 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
JAIR
2010
13 years 6 months ago
2010
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...