167 search results - page 7 / 34 » A class of polynomially solvable linear complementarity prob... |
82
Voted
DAM
2007
15 years 9 days ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
88
Voted
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
98
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
112
Voted
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
ENDM
2006
15 years 11 days ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...