2503 search results - page 346 / 501 » A study of 3-arc graphs |
143
click to vote
JEA
2008
15 years 5 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
189
click to vote
JMLR
2006
15 years 5 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
131
Voted
FMSD
2007
15 years 5 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...
137
click to vote
GC
2007
Springer
15 years 5 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
153
click to vote
TCS
2008
15 years 5 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...