Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p
β¦ LIBER β¦
Algorithms in graph theory and their use for solving problems in architectural design
β Scribed by J. Roth; R. Hashimshony
- Book ID
- 107744487
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 735 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A branch-and-cut algorithm for solving g
β
Suhl, Uwe H.; Hilbert, Heinrich
π
Article
π
1998
π
John Wiley and Sons
π
English
β 163 KB
π 2 views
Work-efficient BSR-based parallel algori
β
Jean-FrΓ©dΓ©ric Myoupo; David SemΓ©
π
Article
π
2006
π
Springer US
π
English
β 361 KB
Maximizing the total number of spanning
β
Ching-Shui Cheng
π
Article
π
1981
π
Elsevier Science
π
English
β 436 KB
Use of episodic knowledge and informatio
β
Willemien Visser
π
Article
π
1995
π
Elsevier Science
π
English
β 834 KB
Probabilistic ideas in heuristic algorit
β
I. Gertsbach
π
Article
π
1977
π
John Wiley and Sons
π
English
β 583 KB
Problem solving as reinforcement in adol
β
Ruth Triplett; Brian Payne
π
Article
π
2004
π
Elsevier Science
π
English
β 161 KB
The problem of adolescent drug use received a great deal of attention both in criminological theory and public policy. Predominant among theories was Akers' social learning theory which examined the role of learning through a process of imitation, modeling, and reinforcement. Public policy led to th