|
|
|
|
|
Candido Ferreira Xavier de Mendonça Neto, Peter Eades
Pág. 841 - 845
Dado um grafo orientado G, uma cobertura é um subconjunto B de arestas que interceptam todos os cortes de G. De maneira equivalente, a contração das arestas de B tornam o grafo G fortemente conexo. Um algoritmo primal-dual de complexidade O(n5) é apresen...
ver más
|
|
|
|
|
|
|
|
|
|
|
Candido Ferreira Xavier de Mendonça Neto, Peter Eades (Author)
Pág. 841 - 845
Given a directed graph G, a covering is a subset B of arcs which meets all directed cuts of G. Equivalently, the contraction of the elements of B makes G strongly connected. An O(n5) primal-dual algorithm is presented by Frank (1981) for finding a minimu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Plan...
ver más
|
|
|
|
|
|