1995
DOI: 10.1007/978-3-322-89870-8
|View full text |Cite
|
Sign up to set email alerts
|

Graphen Algorithmen Netze

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1999
1999
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…E Kaderali and Poguntke [45] solve the problem with shortest path search in a network between the vertices r3R and t with the adaptive algorithm after Bellman}Ford, in which a cost function w: EP-> is projected on the departing edges from spotbeams and satellites. The costs correspond to the actual #ow over the edge w(e X@ )"f (e X@ ) and w(e @Q )"f (e @Q ), w(e)"0, else.…”
Section: Flow Graphs For Adaptive Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…E Kaderali and Poguntke [45] solve the problem with shortest path search in a network between the vertices r3R and t with the adaptive algorithm after Bellman}Ford, in which a cost function w: EP-> is projected on the departing edges from spotbeams and satellites. The costs correspond to the actual #ow over the edge w(e X@ )"f (e X@ ) and w(e @Q )"f (e @Q ), w(e)"0, else.…”
Section: Flow Graphs For Adaptive Schemesmentioning
confidence: 99%
“…This maximum #ow can be derived from the #ow graph through the Ford}Fulkerson algorithm [29,45] or the Edmonds}Karp algorithm [45,46]. Blocking occurs if the #ow out of the source is less than the capacity of the departing edges from the source: f (e QP )(k(e QP ).…”
Section: Flow Graphs For Soramentioning
confidence: 99%