2503 search results - page 101 / 501 » A study of 3-arc graphs |
166
click to vote
DALT
2004
Springer
15 years 11 months ago
2004
Springer
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...
174
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
175
Voted
JGAA
2002
15 years 5 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
173
Voted
MLQ
1998
15 years 5 months ago
1998
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
156
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...