Disjoint pathsDigraphsTournamentsLinking problemPolynomial-time algorithmIndependence numberA digraph H is infused in a digraph G if the vertices of H are mapped to vertices of G (not necessarily distinct), and the edges of H are mapped to edge-disjoint directed paths of G joining the ...
Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or ... B Jackson - 《Journal of Graph Theory》 被引量: 48发表: 2010年 Symmetric Property and Reliability of ...
Wu, "Fast distributed DFS solutions for edge-disjoint paths in digraphs," in Membrane Computing, ser. Lecture Notes in Computer Science, E. Csuhaj-Varju麓, M. Gheorghe, G. Rozenberg, A. Salomaa, and G. Vaszil, Eds. Springer-Verlag, Berlin Heidelberg, 2013, vol. 7762, pp. 173-194....
Guo L,Shen H.Hardness of finding two edge-disjoint Min-Min paths in digraphs. Lecture Notes in Computer Science . 2011Guo, L., Shen, H.: Hardness of finding two edge-disjoint min-min paths in digraphs. In: Frontiers in Algorithmics and Algorithmic Aspe...
Given a graph and pairs S_it_i of terminals, the edge-disjoint paths problem is to determine whether there exist Siti paths that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n~(O(k)) where k is the number...
We use in our construction "self-similar" graphs which technique could be useful in other problems as well.doi:10.1002/jgt.22046JoóAttilaJournal of Graph TheoryJoo, A. Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair. Journal of Graph ...
We use in our construction “self‐similar” graphs which technique could be useful in other problems as well.JoóEotvos Lorond UnivAttilaEotvos Lorond UnivJournal of Graph TheoryJoo, A. Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair....