3204 search results - page 305 / 641 » The Alcuin Number of a Graph |
172
click to vote
FSTTCS
1994
Springer
15 years 11 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
163
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if 4 and mad(G) < 14 5 , then i(G...
221
click to vote
DM
2010
15 years 7 months ago
2010
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
216
click to vote
CIDM
2009
IEEE
15 years 11 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
240
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...