Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Interval graphs, circular-arc And circular-arc overlaps graphs
Angličtina
133 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
26.89
€
/
Brožovaná
13.84
€
/
Brožovaná
44.08
€
Circular-arc graphs are a new class of intersection graphs, defined for a set of arcs on a circle. A graph is a circular-arc graph, if it is the intersection graph of a finite set of arcs on a circle.That is, there exists one arc for each vertex of G and two vertices in G are adjacent in G,if and only if the corresponding arcs intersect.A vertex is said to dominate another vertex if there is an edge between the two vertices.If we bend the arc into a line, then the family of arcs is transformed into a family of intervals.Therefore, every interval graph is a CAG, where the opposite is always not true. However,these days CAG as well as interval graphs are being patronized very much. The combinatorial structures in CAG are varied and extensive, where it finds an application in many other fields such as biology, genetics, traffic control,computer science and particularly useful in cyclic scheduling and computer storage allocation problems etc.Circular-arc overlap graphs are a new class of overlap graphs introduced by Kashiwabara and Masuda [2], defined for a set of arcs on a circle.
Informácie o knihe
Angličtina
Kategórie
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
9.80
€
/
Brožovaná
16.57
€
/
Pevná
25.57
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?