Stable Networks And Product Graphs
Seiten
1995
American Mathematical Society (Verlag)
978-0-8218-0347-9 (ISBN)
American Mathematical Society (Verlag)
978-0-8218-0347-9 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
A network is a collection of gates, each with many inputs and many outputs, where links join individual outputs to individual inputs of gates; the unlinked inputs and outputs of gates are viewed as inputs and outputs of the network. A stable configuration assigns values to inputs, outputs, and links in a network, to ensure that the gate equations are satisfied. The problem of finding stable configurations in a network is computationally hard. In this work, Feder restricts attention to gates that satisfy a non-expansiveness condition requiring small perturbations at the inputs of a gate to have only a small effect at the outputs of the gate. The stability question on the class of networks satisfying this local non-expansiveness condition contains stable matching as a main example, and defines the boundary between tractable and intractable versions of network stability.
Erscheint lt. Verlag | 30.7.1995 |
---|---|
Reihe/Serie | Memoirs of the American Mathematical Society |
Verlagsort | Providence |
Sprache | englisch |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
Schlagworte | Memoirs of the AMS; No. 555 |
ISBN-10 | 0-8218-0347-6 / 0821803476 |
ISBN-13 | 978-0-8218-0347-9 / 9780821803479 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
64,95 €