65 search results - page 4 / 13 » Two Polynomial Time Algorithms for the Metro-line Crossing M... |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
ENDM
2010
13 years 5 months ago
2010
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
JCO
2006
13 years 8 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...