Suchergebnisse - "Graph Theory and Algorithms"

Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms von Yu, Pei-Duo, Tan, Chee Wei, Fu, Hung-Lin

“… Cascading failures in critical networked infrastructures that result even from a single source of failure often lead to rapidly widespread outages as witnessed …”
Volltext

Efficient algorithms for scheduling multiple bulk data transfers in inter-datacenter networks von Su, Sen, Wang, Yiwen, Jiang, Sujuan, Shuang, Kai, Xu, Peng

“… SUMMARYBulk data transfers, such as backups and propagation of bulky updates, account for a large portion of the inter‐datacenter traffic. These bulk transfers …”
Volltext

Complexity of greedy edge-colouring von Havet, Frédéric, Maia, A. Karolinna, Yu, Min-Li

“… The Grundy index of a graph G =(V, E ) is the greatest number of colours that the greedy edge-colouring algorithm can use on G . We prove that the problem of …”
Volltext

Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems von Couto, Fernanda, Faria, Luerbio, Klein, Sulamita

“… Background In this work, we consider the graph sandwich decision problem for property Π , introduced by Golumbic, Kaplan and Shamir: given two graphs G 1 =( V …”
Volltext

Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees von Tahir, Muhammad Atif, Jamshed, Asif, Rehman, Habib-ur, Daadaa, Yassine

“… In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the …”
Volltext

On spanning 2-trees in a graph von Cai, Leizhen

“… A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose …”
Volltext