Complexity of graph evolutions
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913591968399360 |
|---|---|
| author | Gao, Jeffrey Kainen, Paul C. |
| author_facet | Gao, Jeffrey Kainen, Paul C. |
| contents | A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an {\it opportunity cost} for the construction sequence. Maximum and minimum cost c-sequences are provided for a variety of graphs and are used to measure the complexity of graph-building programs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_00212 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Complexity of graph evolutions Gao, Jeffrey Kainen, Paul C. Combinatorics Discrete Mathematics 05A05, 05A17, 05C09, 05C78 G.2.2; C.1.4 A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an {\it opportunity cost} for the construction sequence. Maximum and minimum cost c-sequences are provided for a variety of graphs and are used to measure the complexity of graph-building programs. |
| title | Complexity of graph evolutions |
| topic | Combinatorics Discrete Mathematics 05A05, 05A17, 05C09, 05C78 G.2.2; C.1.4 |
| url | https://arxiv.org/abs/2412.00212 |