Sciweavers

2801 search results - page 189 / 561
» On the Adequateness of the Connection Method
Sort
View
DM
2007
113views more  DM 2007»
15 years 6 months ago
Counting labeled general cubic graphs
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
ACTAC
2005
77views more  ACTAC 2005»
15 years 6 months ago
The lexicographic decision function
: In this paper the lexicographic decision process is presented in a unified way. We construct a lexicographic decision function using a universal preference function and a unary f...
József Dombi, Nándor Vincze
JCT
2007
90views more  JCT 2007»
15 years 6 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
ACL
2010
15 years 4 months ago
Automatic Selectional Preference Acquisition for Latin Verbs
We present a system that automatically induces Selectional Preferences (SPs) for Latin verbs from two treebanks by using Latin WordNet. Our method overcomes some of the problems c...
Barbara McGillivray
TCS
2011
15 years 1 months ago
Local and global price of anarchy of graphical games
This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifie...
Oren Ben-Zwi, Amir Ronen