Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Uri N. Peled"'
Publikováno v:
Linear Algebra and its Applications. 431:266-273
In this paper we study a 2-color analog of the cycle cone of a graph. Suppose the edges of a graph are colored red and blue. A nonnegative real vector on the edges is said to be balanced if the red sum equals the blue sum at every vertex. A balanced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::757505c427d41eafa0ddbd86983b1ec8
https://doi.org/10.1016/j.laa.2009.02.029
https://doi.org/10.1016/j.laa.2009.02.029
Publikováno v:
Discrete Applied Mathematics. 156(4):462-477
A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a necessary condition for a graph to be equistable is sufficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::022f19b9722095a7ecaa5bd1b12cb391
Publikováno v:
Linear Algebra and its Applications. 426:458-461
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
5 pages, 1 figure
5 pages, 1 figure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c1e09b7134e04b7bd95021fa3fa6224
https://doi.org/10.1016/j.laa.2007.05.022
https://doi.org/10.1016/j.laa.2007.05.022
Publikováno v:
IEEE Transactions on Information Theory. 50:2378-2388
Low-density parity-check (LDPC) codes are serious contenders to turbo codes in terms of decoding performance. One of the main problems is to give an explicit construction of such codes whose Tanner graphs have known girth. For a prime power q and m/s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a19313e4b3c99307ded5b6de09bec9c2
https://doi.org/10.1109/tit.2004.834760
https://doi.org/10.1109/tit.2004.834760
Autor:
Uri N. Peled, Ephraim Korach
Publikováno v:
Discrete Applied Mathematics. 132(1-3):149-162
A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series–parallel graphs that are equistable, general
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce0d92e8688f8708b70f3e839690183a
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, Julin Wu
Publikováno v:
Journal of Graph Theory. 30:121-136
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fe06631b980e742215c5caea731c400
https://doi.org/10.1002/(sici)1097-0118(199902)30:2<121::aid-jgt6>3.0.co
https://doi.org/10.1002/(sici)1097-0118(199902)30:2<121::aid-jgt6>3.0.co
Publikováno v:
Discrete Applied Mathematics. 68:169-188
Preemptive open shop scheduling can be viewed as an edge coloring problem in a bipartite multigraph. In some applications, restrictions of colors (in particular preassignments) are made for some edges. We give characterizations of graphs where some s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9ec6bdf22dca9332f55a3db8f19a3f8
https://doi.org/10.1016/0166-218x(95)00055-v
https://doi.org/10.1016/0166-218x(95)00055-v
Autor:
Uri N. Peled, Feng Sun
Publikováno v:
Discrete Applied Mathematics. 60(1-3):311-318
A difference graph is a bipartite graph G = (X, Y; E) such that all the neighborhoods of the vertices of X are comparable by inclusion. We enumerate labeled and unlabeled difference graphs with or without a bipartition of the vertices into two stable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ba2f2351e7c00f59e9b01e5ca9f2a5c
Autor:
N. V. R. Mahadev, Uri N. Peled
Publikováno v:
Discrete Mathematics. 135(1-3):169-176
The length of a longest cycle in a threshold graph is obtained in terms of a largest matching in a specially structured bipartite graph. It can be computed in linear time. As a corollary, Hamiltonian threshold graphs are characterized. This character
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a251da587486ef9f629b01c6c0f6e6e