85 search results - page 3 / 17 » Complexity of some Path Problems in DAGs and Linear Orders |
111
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
NHM
2010
14 years 6 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
115
click to vote
TCS
2010
14 years 10 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
MP
2008
14 years 11 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
112
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...