Sciweavers

2283 search results - page 67 / 457
» Bounds of Graph Characteristics
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 8 months ago
Menger's Paths with Minimum Mergings
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
Guangyue Han
ENDM
2006
119views more  ENDM 2006»
13 years 8 months ago
The incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
Stephan Dominique Andres
ICML
2010
IEEE
13 years 9 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
PRL
2006
89views more  PRL 2006»
13 years 7 months ago
ROC graphs with instance-varying costs
Receiver Operating Characteristics (ROC) graphs are a useful technique for organizing classifiers and visualizing their performance. ROC graphs have been used in cost-sensitive le...
Tom Fawcett