Verwandte Artikel zu Vertex Cycle Cover: Graph (Mathematics), Spanning Subgraph,...

Vertex Cycle Cover: Graph (Mathematics), Spanning Subgraph, Subgraph, Cycle (Graph Theory), Digraphs - Softcover

 
9786131135354: Vertex Cycle Cover: Graph (Mathematics), Spanning Subgraph, Subgraph, Cycle (Graph Theory), Digraphs
Softcover
ISBN 10: 6131135355 ISBN 13: 9786131135354
Verlag: OmniScriptum, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph is the set of cycles which are subgraphs of G and contain all vertices of G. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G. If the cycles of the cover have no edges in common, the cover is called edge-disjoint or simply disjoint cycle cover. Similar definitions may be introduced for digraphs, in terms of directed cycles. The permanent of a 01-matrix is equal to the number of cycle covers of a directed graph with this adjacency matrix. This fact is used in a simplified proof of the fact that computation of the permanent is #P-complete.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph is the set of cycles which are subgraphs of G and contain all vertices of G. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G. If the cycles of the cover have no edges in common, the cover is called edge-disjoint or simply disjoint cycle cover. Similar definitions may be introduced for digraphs, in terms of directed cycles. The permanent of a 01-matrix is equal to the number of cycle covers of a directed graph with this adjacency matrix. This fact is used in a simplified proof of the fact that computation of the permanent is #P-complete.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6131135355
ISBN 13 
9786131135354
Einband
Tapa blanda
Anzahl der Seiten
64
Herausgeber
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar