Zobrazeno 1 - 10
of 272
pro vyhledávání: '"Faigle, U"'
Autor:
Müller, R, author1, Brockhaus-Dumke, A, author2, Popovych, S, author3, Küpper, T, author4, Klosterkötter, J, author5, Faigle, U, author6
Publikováno v:
Neuro-Visionen 4: Perspektiven in Nordrhein-Westfalen. :169-170
Publikováno v:
In Electronic Notes in Discrete Mathematics 2001 8:76-79
Publikováno v:
In Journal of Algorithms April 1999 31(1):196-210
Publikováno v:
Proceedings Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'06, Lambrecht, Germany, June 5-9, 2006), 29-33
STARTPAGE=29;ENDPAGE=33;TITLE=Proceedings Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'06, Lambrecht, Germany, June 5-9, 2006)
Electronic notes in discrete mathematics, 25, 29-33. Elsevier
STARTPAGE=29;ENDPAGE=33;TITLE=Proceedings Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'06, Lambrecht, Germany, June 5-9, 2006)
Electronic notes in discrete mathematics, 25, 29-33. Elsevier
No abstract.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bc18ad614ea644e73805911df6bef0f
https://doi.org/10.1016/j.endm.2006.06.058
https://doi.org/10.1016/j.endm.2006.06.058
Publikováno v:
Theoretical computer science, 303(3), 371-376. Elsevier
We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ = 3 is at most Δ + 1. We show that the same holds true in case Δ ≥ 6, which wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c8285245f335b2936674414def5aa28
https://doi.org/10.1016/j.tcs.2002.10.002
https://doi.org/10.1016/j.tcs.2002.10.002
Publikováno v:
Mathematical methods of operations research, 43(2), 239-254. Physica-Verlag
We consider the following game: Two players independently choose a chain in a partially ordered set. How many bits of information have to be communicated until at least one of the players knows whether the chains have exactlyt elements in common? Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38da4f260b83a74526090d252371c31b
https://doi.org/10.1007/bf01680375
https://doi.org/10.1007/bf01680375
Publikováno v:
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010), 29-32
STARTPAGE=29;ENDPAGE=32;TITLE=Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
STARTPAGE=29;ENDPAGE=32;TITLE=Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to nd such edges in bipartite graphs. The expected time complexity of our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::e7cdaf7fe79ee62f6c5da96bacdad65d
https://research.utwente.nl/en/publications/bisimplicial-edges-in-bipartite-graphs(1d0c4577-8bea-410c-8fad-8f4f9d3ed0d0).html
https://research.utwente.nl/en/publications/bisimplicial-edges-in-bipartite-graphs(1d0c4577-8bea-410c-8fad-8f4f9d3ed0d0).html
Publikováno v:
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010), 119-122
STARTPAGE=119;ENDPAGE=122;TITLE=Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
STARTPAGE=119;ENDPAGE=122;TITLE=Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipped independently with a probability of $\varepsilon > 0$. Our algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::b30e96a1937cb17dc8b046e1e269d83e
https://research.utwente.nl/en/publications/approximating-independent-set-in-semirandom-graphs(8098adf9-e781-4453-bfe5-b542427d2062).html
https://research.utwente.nl/en/publications/approximating-independent-set-in-semirandom-graphs(8098adf9-e781-4453-bfe5-b542427d2062).html