Stable networks and product graphs:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1991
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1362 |
| Schlagwörter: | |
| Abstract: | Abstract: "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, so as to ensure that the gate equations are satisfied. The problem of finding stable configurations in a network is computationally hard, even when all values are boolean and all input values are specified in advance; in general, the difficulty of a stability problem seems to depend on the kinds of gates present in the network. The study can be restricted to gates that satisfy a nonexpansiveness 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 nonexpansiveness condition contains stable matching as a main example, and defines the boundary between tractable and intractable versions of network stability. The structural and algorithmic study of stability in nonexpansive networks is based on a representation of the possible assignments of boolean values for a network as vertices in a boolean hypercube under the associated Hamming metric. This global view takes advantage of the median properties of the hypercube, and extends to metric networks, where individual values are now chosen from finite metric spaces and combined by means of an additive product operation The relationship between products of metric spaces and products of graphs then establishes a connection between isometric representations in graphs and nonexpansiveness in metric networks. |
| Beschreibung: | Stanford, Univ., Diss. |
| Umfang: | VIII, 211 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008979354 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1991 xx m||| 00||| eng d | ||
| 035 | |a (OCoLC)25485264 | ||
| 035 | |a (DE-599)BVBBV008979354 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Feder, Tomás |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Stable networks and product graphs |c by Tomás Feder |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a VIII, 211 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1362 | |
| 500 | |a Stanford, Univ., Diss. | ||
| 520 | 3 | |a Abstract: "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, so as to ensure that the gate equations are satisfied. The problem of finding stable configurations in a network is computationally hard, even when all values are boolean and all input values are specified in advance; in general, the difficulty of a stability problem seems to depend on the kinds of gates present in the network. The study can be restricted to gates that satisfy a nonexpansiveness condition requiring small perturbations at the inputs of a gate to have only a small effect at the outputs of the gate | |
| 520 | 3 | |a The stability question on the class of networks satisfying this local nonexpansiveness condition contains stable matching as a main example, and defines the boundary between tractable and intractable versions of network stability. The structural and algorithmic study of stability in nonexpansive networks is based on a representation of the possible assignments of boolean values for a network as vertices in a boolean hypercube under the associated Hamming metric. This global view takes advantage of the median properties of the hypercube, and extends to metric networks, where individual values are now chosen from finite metric spaces and combined by means of an additive product operation | |
| 520 | 3 | |a The relationship between products of metric spaces and products of graphs then establishes a connection between isometric representations in graphs and nonexpansiveness in metric networks. | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Stabilität |0 (DE-588)4056693-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkmodell |0 (DE-588)4131643-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Netzwerkmodell |0 (DE-588)4131643-5 |D s |
| 689 | 0 | 1 | |a Stabilität |0 (DE-588)4056693-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1362 |w (DE-604)BV008928280 |9 1362 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005930074 | |
Datensatz im Suchindex
| _version_ | 1818951145997991936 |
|---|---|
| any_adam_object | |
| author | Feder, Tomás |
| author_facet | Feder, Tomás |
| author_role | aut |
| author_sort | Feder, Tomás |
| author_variant | t f tf |
| building | Verbundindex |
| bvnumber | BV008979354 |
| ctrlnum | (OCoLC)25485264 (DE-599)BVBBV008979354 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03040nam a2200409 cb4500</leader><controlfield tag="001">BV008979354</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1991 xx m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25485264</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008979354</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feder, Tomás</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stable networks and product graphs</subfield><subfield code="c">by Tomás Feder</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 211 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1362</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Stanford, Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "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, so as to ensure that the gate equations are satisfied. The problem of finding stable configurations in a network is computationally hard, even when all values are boolean and all input values are specified in advance; in general, the difficulty of a stability problem seems to depend on the kinds of gates present in the network. The study can be restricted to gates that satisfy a nonexpansiveness condition requiring small perturbations at the inputs of a gate to have only a small effect at the outputs of the gate</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The stability question on the class of networks satisfying this local nonexpansiveness condition contains stable matching as a main example, and defines the boundary between tractable and intractable versions of network stability. The structural and algorithmic study of stability in nonexpansive networks is based on a representation of the possible assignments of boolean values for a network as vertices in a boolean hypercube under the associated Hamming metric. This global view takes advantage of the median properties of the hypercube, and extends to metric networks, where individual values are now chosen from finite metric spaces and combined by means of an additive product operation</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The relationship between products of metric spaces and products of graphs then establishes a connection between isometric representations in graphs and nonexpansiveness in metric networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Stabilität</subfield><subfield code="0">(DE-588)4056693-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkmodell</subfield><subfield code="0">(DE-588)4131643-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerkmodell</subfield><subfield code="0">(DE-588)4131643-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Stabilität</subfield><subfield code="0">(DE-588)4056693-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1362</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1362</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005930074</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV008979354 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:29:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005930074 |
| oclc_num | 25485264 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | VIII, 211 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Feder, Tomás Verfasser aut Stable networks and product graphs by Tomás Feder Stanford, Calif. 1991 VIII, 211 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1362 Stanford, Univ., Diss. Abstract: "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, so as to ensure that the gate equations are satisfied. The problem of finding stable configurations in a network is computationally hard, even when all values are boolean and all input values are specified in advance; in general, the difficulty of a stability problem seems to depend on the kinds of gates present in the network. The study can be restricted to gates that satisfy a nonexpansiveness 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 nonexpansiveness condition contains stable matching as a main example, and defines the boundary between tractable and intractable versions of network stability. The structural and algorithmic study of stability in nonexpansive networks is based on a representation of the possible assignments of boolean values for a network as vertices in a boolean hypercube under the associated Hamming metric. This global view takes advantage of the median properties of the hypercube, and extends to metric networks, where individual values are now chosen from finite metric spaces and combined by means of an additive product operation The relationship between products of metric spaces and products of graphs then establishes a connection between isometric representations in graphs and nonexpansiveness in metric networks. Computer networks Graph theory Stabilität (DE-588)4056693-6 gnd rswk-swf Netzwerkmodell (DE-588)4131643-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Netzwerkmodell (DE-588)4131643-5 s Stabilität (DE-588)4056693-6 s DE-604 Computer Science Department: Report STAN-CS Stanford University 1362 (DE-604)BV008928280 1362 |
| spellingShingle | Feder, Tomás Stable networks and product graphs Computer networks Graph theory Stabilität (DE-588)4056693-6 gnd Netzwerkmodell (DE-588)4131643-5 gnd |
| subject_GND | (DE-588)4056693-6 (DE-588)4131643-5 (DE-588)4113937-9 |
| title | Stable networks and product graphs |
| title_auth | Stable networks and product graphs |
| title_exact_search | Stable networks and product graphs |
| title_full | Stable networks and product graphs by Tomás Feder |
| title_fullStr | Stable networks and product graphs by Tomás Feder |
| title_full_unstemmed | Stable networks and product graphs by Tomás Feder |
| title_short | Stable networks and product graphs |
| title_sort | stable networks and product graphs |
| topic | Computer networks Graph theory Stabilität (DE-588)4056693-6 gnd Netzwerkmodell (DE-588)4131643-5 gnd |
| topic_facet | Computer networks Graph theory Stabilität Netzwerkmodell Hochschulschrift |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT federtomas stablenetworksandproductgraphs |