Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Ordered Graph
CHF 37.30
Auf Lager
SKU
4KROAOA77L7
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. An ordered graph is a graph with a total order over its nodes.The induced graph of an ordered graph is obtained by adding some edges to an ordering graph, using the method outlined below. The induced width of an ordered graph is the width of its induced graph. Given an ordered graph, its induced graph is another ordered graph obtained by joining some pairs of nodes that are both parents of another node. In particular, nodes are considered in turn according to the ordering, from last to first. For each node, if two of its parents are not joined by an edge, that edge is added. In other words, when considering node n, if both m and l are parents of it and are not joined by an edge, the edge (m,l) is added to the graph. Since the parents of a node are always connected with each other, the induced graph is always chordal. As an example, the induced graph of an ordered graph is calculated.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131297595
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131297595
- Format Fachbuch
- Titel Ordered Graph
- Herausgeber Betascript Publishing
- Anzahl Seiten 64
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
