458 search results - page 30 / 92 » Perfect Skolem sets |
103
click to vote
JELIA
2000
Springer
15 years 3 months ago
2000
Springer
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
100
click to vote
DM
2007
14 years 11 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...
TCOM
2010
14 years 10 months ago
2010
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
WG
2009
Springer
15 years 6 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...