Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Path Decomposition: Graph Theory, Path Graph, Maximum Clique -

inglise keel
2026-04-10
117,44 € 195,73 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number that measures how much the path was thickened to form G. More formally, a path-decomposition is a sequence of subsets of vertices ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number that measures how much the path was thickened to form G. More formally, a path-decomposition is a sequence of subsets of vertices of G such that the endpoints of each edge appear in one of the subsets and such that each vertex appears in a contiguous subsequence of the subsets, and the pathwidth is one less than the size of the largest set in such a decomposition. Pathwidth is also known as interval thickness (one less than the maximum clique size in an interval supergraph of G), vertex separation number, or node searching number.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786133630666
Kirjuta oma arvustus
Te vaatate: Path Decomposition: Graph Theory, Path Graph, Maximum Clique
Teie hinnang:

Goodreads'i arvustused

117,44 € 195,73 €