Reliability of communication networks with delay constraints: computational complexity and complete topologies.

Cancela, H.; Petingi, L.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Reliability of communication networks with delay constraints: computational complexity and complete topologies.”

On the minimal length of the longest trail in a fixed edge-density graph

Vajk Szécsi (2013)

Open Mathematics

Similarity:

A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).

An efficient implementation of Sugiyama's algorithm for layered graph drawing.

Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)

Journal of Graph Algorithms and Applications

Similarity:

Permanents, Pfaffian orientations, and even directed circuits.

Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)

Annals of Mathematics. Second Series

Similarity:

Intersection Graphs of Graphs

Bohdan Zelinka (1975)

Matematický časopis

Similarity:

Eulerian polar graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity:

Analoga of Menger's theorem for polar and polarized graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity: