522 search results - page 3 / 105 » The 3-Steiner Root Problem |
AISC
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
Gradiance On-Line Accelerated Learning GOAL is a system for creating and automatically grading homeworks, programming laboratories, and tests. Through the concept of root questi...
ICRE
1998
IEEE
14 years 25 days ago
1998
IEEE
Systems requirements errors are numerous, persistent, and expensive. To detect such errors, and focus on critical ones during the development of a requirements document, we have d...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
JCSS
2010
13 years 7 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...