483 search results - page 32 / 97 » On perfectness of sums of graphs |
ISCAS
2005
IEEE
15 years 4 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
87
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...
DM
2007
14 years 10 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
84
Voted
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
87
Voted
FSTTCS
2003
Springer
15 years 4 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...