Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Srinivasa R. Arikati"'
Autor:
Srinivasa R. Arikati, Kurt Mehlhorn
Publikováno v:
Information Processing Letters. 70:251-254
The Stoer‐Wagner algorithm computes a minimum cut in a weighted undirected graph. The algorithm works inn 1 phases, wheren is the number of nodes ofG. Each phase takes time O.mCn logn/ ,w herem is the number of edges ofG, and computes a pair of ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecfb17921ee13e9c0440501d95afb9fa
https://doi.org/10.1016/s0020-0190(99)00071-x
https://doi.org/10.1016/s0020-0190(99)00071-x
Autor:
Uri N. Peled, Srinivasa R. Arikati
Publikováno v:
Linear Algebra and its Applications. 290:213-235
It is known that the degree sequences of threshold graphs are characterized by the property that they are not majorized strictly by any degree sequence. Consequently every degree sequence d can be transformed into a threshold sequence by repeated ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfb6017049b4a25abad59d26f969ac44
https://doi.org/10.1016/s0024-3795(98)10229-x
https://doi.org/10.1016/s0024-3795(98)10229-x
Autor:
Uri N. Peled, Srinivasa R. Arikati
Publikováno v:
Linear Algebra and its Applications. 199:179-211
A classical result concerning majorization is: given two nonnegative integer sequences a and b such that a majorizes b, a rearrangement of b can be obtained from a by a sequence of unit transformations. A recent result says that a degree sequence is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67e27faa3c55c9aa8762d6580dc19121
Publikováno v:
IndraStra Global.
An efficient reduction process for path problems on circular-arc graphs is introduced. For the parity path problem, this reduction gives an O(n+m) algorithm for proper circular-arc graphs, and an O(n+m) algorithm for general circular-arc graphs. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf88ae5ebd621f3239960742a8828465
https://igi.indrastra.com/items/show/70619
https://igi.indrastra.com/items/show/70619
Autor:
Srinivasa R. Arikati, C. Pandu Rangan
Publikováno v:
IndraStra Global.
Let G = (V, E) be an undirected, finite, and simple graph. All the definitions not given here may be found in [l]. A pair (u, o) of nonadjacent vertices in G form a two-pair if every chordless path between u and v is of length two. We shall digress b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8861d236272b848e5edf4825a1c97ceb
Autor:
Srinivasa R. Arikati, Uri N. Peled
Publikováno v:
Discrete Applied Mathematics. (1-3):5-20
The parity path problem is to test if a graph contains an even (odd) chordless path between two prescribed vertices. A graph is called perfectly orientable if there exists an orientation of its edges such that the resulting digraph has no obstruction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb68bacb1af11b784111d871146562a0
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.