Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Ephraim Korach"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
An $\textit{anticoloring}$ of a graph is a coloring of some of the vertices, such that no two adjacent vertices are colored in distinct colors. We deal with the anticoloring problem with two colors for planar graphs, and, using Lipton and Tarjan's se
Externí odkaz:
https://doaj.org/article/b5fd793b50eb4270b797671aa136e456
Publikováno v:
Theoretical Computer Science. 636:17-26
In the field of information security, the best way of protecting the privacy of the participants is to keep silent. Consider two, not necessarily identical, powerful computers or computer-grids connected by a unidirectional communication link that sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f170704746479ef6a82d23d7e5b84109
https://doi.org/10.1016/j.tcs.2016.04.032
https://doi.org/10.1016/j.tcs.2016.04.032
Publikováno v:
Discrete Applied Mathematics. 188:1-15
An anticoloring of a graph is a partial coloring of the vertices in which no two adjacent vertices are colored in distinct colors. In the basic anticoloring problem, we are given a graph G and positive integers B 1 , ? , B k , and have to determine w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ff9b8d43ac4854b49b9ca20ae01e9ce
https://doi.org/10.1016/j.dam.2015.02.023
https://doi.org/10.1016/j.dam.2015.02.023
Publikováno v:
Journal of Global Optimization. 54:649-667
Given a graph G and positive integers B and W, the BWC problem asks about the existence of a coloring of G, with B black and W white vertices, such that there is no edge between a black and a white vertex. We suggest a heuristic, based on tabu search
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd38e819580adef0d4cc70b4c971a432
https://doi.org/10.1007/s10898-011-9783-1
https://doi.org/10.1007/s10898-011-9783-1
Publikováno v:
International Journal of Production Economics. 119:298-307
We extend the classical scheduling problem of minimizing the number of tardy jobs in a single-machine to the case where the job processing times are controllable by allocating a continuous and non-renewable resource to the processing operations. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ccadcea4f968afc41abbf68f8827b98
https://doi.org/10.1016/j.ijpe.2009.03.003
https://doi.org/10.1016/j.ijpe.2009.03.003
Publikováno v:
Discrete Mathematics. 308:4670-4695
We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::089af9ee80830a5107bdc8ca61924552
https://doi.org/10.1016/j.disc.2007.08.083
https://doi.org/10.1016/j.disc.2007.08.083
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
Autor:
Ephraim Korach, Michal Stern
Publikováno v:
Discrete Applied Mathematics. 156(4):444-450
We consider the following complete optimal stars-clustering-tree problem: Given a complete graph G=(V,E) with a weight on every edge and a collection of subsets of V, we want to find a minimum weight spanning tree T such that each subset of the verti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d383a7ee60d3c45dbe66c31abb3076a
Publikováno v:
Electronic Notes in Discrete Mathematics. 28:445-451
An anticoloring of a graph is a coloring of some of the vertices, such that no two adjacent vertices are colored in distinct colors. The anticoloring problem seeks, roughly speaking, for such colorings with many vertices colored in each color. We sho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d9ab2620495a7a1203c3edc5ccde6d9
https://doi.org/10.1016/j.endm.2007.01.062
https://doi.org/10.1016/j.endm.2007.01.062
Publikováno v:
IEEE Sensors Journal. 5:59-67
A procedure to rank sensors according to their noise rates was developed based on an adaptive fuzzy logic algorithm for sensor fusion. No a priori knowledge of the sensors performance is assumed. Simulation analysis indicated 83.33% successful rankin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63000130af0d8873c4b277a87e3e4b25
https://doi.org/10.1109/jsen.2004.839596
https://doi.org/10.1109/jsen.2004.839596