𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for Graphs Embeddable with Few Crossings per Edge

✍ Scribed by Alexander Grigoriev; Hans L. Bodlaender

Publisher
Springer
Year
2007
Tongue
English
Weight
194 KB
Volume
49
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for construction of a k-con
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
✍ Ulrich Schumacher πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

A linear time algorithm for computing th
A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges
✍ Charles J. Colbourn; Guoliang Xue πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 993 KB

Given a network with n vertices and m edges where each edge has an independent operational probability, we are interested in finding a vertex of the network whose expected number of reachable vertices is maximum. Such a vertex is called a most reliable source of the network. This problem was studied