3105 search results - page 387 / 621 » The Path-Packing Structure of Graphs |
116
Voted
FMSD
2007
15 years 4 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
131
click to vote
GPEM
2007
15 years 4 months ago
2007
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
115
click to vote
DM
2002
15 years 4 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
129
click to vote
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
158
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...