1161 search results - page 55 / 233 » Kinetic Dependence Graphs |
130
click to vote
COMBINATORICA
2010
14 years 7 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
105
Voted
DAGSTUHL
2000
15 years 1 months ago
2000
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
78
Voted
JOSS
2000
15 years 9 days ago
2000
: Data structures comprising many binary variables can be represented graphically in various ways. Depending on the purpose different plots might be useful. Here two ways of showin...
81
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
116
click to vote
ECCC
2006
15 years 16 days ago
2006
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...