Results 41 to 50 of about 50 (50)
Some of the next articles are maybe not open access.
The matching-connectivity of a graph
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li +6 more
openaire +2 more sources
On connected resolvability of graphs [PDF]
Australas. J Comb., 2003 An ordered vertex subset \(W\) of a connected graph \(G\) is resolving when the vectors of distances towards \(W\) are different for all vertices of \(G\). The connected resolving number of \(G\), \(\text{cr}(G)\), is the smallest cardinality of a connected resolving set, and any such minimum set is a cr-set.
Varaporn Saenpholphat, Ping Zhang 0004
openaire +1 more source
Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74, 1974
An algorithm proposed by Dinic for finding maximum flows in networks and by Hopcroft and Karp for finding maximum bipartite matchings is applied to graph connectivity problems. It is shown that the algorithm requires 0(V1/2E) time to find a maximum set of node-disjoint paths in a graph, and 0(V2/3E) time to find a maximum set of edge disjoint paths ...
openaire +1 more source
An algorithm proposed by Dinic for finding maximum flows in networks and by Hopcroft and Karp for finding maximum bipartite matchings is applied to graph connectivity problems. It is shown that the algorithm requires 0(V1/2E) time to find a maximum set of node-disjoint paths in a graph, and 0(V2/3E) time to find a maximum set of edge disjoint paths ...
openaire +1 more source
Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86, 1986
openaire +1 more source
openaire +1 more source
Congruent Graphs and the Connectivity of Graphs
American Journal of Mathematics, 1932openaire +2 more sources