2 papers
cs.CC2019
Fixed-parameter tractability of counting small minimum -cuts
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel +1
The parameterized complexity of counting minimum cuts stands as a natural question because Ball and Provan showed its #P-completeness. For any undirected graph and two di…
cs.DC2011
Performance improvement of an optical network providing services based on multicast
Vincent Reinhard, Johanne Cohen, Joanna Tomasik +2
Operators of networks covering large areas are confronted with demands from some of their customers who are virtual service providers. These providers may call for the connectivity…