Zobrazeno 1 - 10
of 8 464
pro vyhledávání: '"A, Watel"'
Autor:
Richard Klein
Publikováno v:
Docomomo Journal, Iss 63 (2021)
Externí odkaz:
https://doaj.org/article/94c67f6900724f2db30b73c783ad05f2
A line digraph $L(G) = (A, E)$ is the digraph constructed from the digraph $G = (V, A)$ such that there is an arc $(a,b)$ in $L(G)$ if the terminal node of $a$ in $G$ is the initial node of $b$. The maximum number of arcs in a line digraph with $m$ n
Externí odkaz:
http://arxiv.org/abs/2406.05141
Autor:
Richard Klein
Publikováno v:
Docomomo Journal, Iss 63 (2020)
Externí odkaz:
https://doaj.org/article/c54197b77f9346ec8c3d910e62f01f58
We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the size of their intersection. We provide a comprehensive complexity anal
Externí odkaz:
http://arxiv.org/abs/2404.17223
We address the problem of configuring a power distribution network with reliability and resilience objectives by satisfying the demands of the consumers and saturating each production source as little as possible. We consider power distribution netwo
Externí odkaz:
http://arxiv.org/abs/2311.11707
Autor:
Watel, Dimitri, Poirion, Pierre-Louis
Publikováno v:
International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.426-438
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem. Especially,
Externí odkaz:
http://arxiv.org/abs/2306.01349