Sciweavers

2283 search results - page 195 / 457
» Bounds of Graph Characteristics
Sort
View
UAI
2004
13 years 9 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
COR
2006
94views more  COR 2006»
13 years 8 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
FUIN
2006
139views more  FUIN 2006»
13 years 8 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
JGT
2008
61views more  JGT 2008»
13 years 8 months ago
Irregularity strength of dense graphs
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
Bill Cuckler, Felix Lazebnik
EJC
2007
13 years 8 months ago
Perfect packings with complete graphs minus an edge
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
Oliver Cooley, Daniela Kühn, Deryk Osthus