The following pages link to Dominique Barith (Q705132):
Displaying 37 items.
- (Q346491) (redirect page) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- QoS commitment between vertically integrated autonomous systems (Q635176) (← links)
- Optimal broadcasting in the back to back d-ary trees (Q671386) (← links)
- Periodic gossiping in commuted networks (Q705134) (← links)
- Shuffling biological sequences with motif constraints (Q935837) (← links)
- On the shape of decomposable trees (Q1043555) (← links)
- Routing permutations on graphs via factors (Q1273853) (← links)
- Two edge-disjoint hamiltonian cycles in the butterfly graph (Q1334638) (← links)
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs (Q1364476) (← links)
- Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees (Q1391915) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Parameterized complexity and approximability of coverability problems in weighted Petri nets (Q1662545) (← links)
- Scattering and multi-scattering in trees and meshes, with local routing and without buffering (Q1960604) (← links)
- A polynomial algorithm for deciding the validity of an electrical distribution tree (Q2122795) (← links)
- Optimisation of electrical network configuration: complexity and algorithms for ring topologies (Q2227500) (← links)
- Automated prediction of three-way junction topological families in RNA secondary structures (Q2359334) (← links)
- A degree bound on decomposable trees (Q2368920) (← links)
- On the \(b\)-continuity property of graphs (Q2381540) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Directed Steiner Tree with Branching Constraint (Q2920465) (← links)
- (Q3439688) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach (Q3614995) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- (Q4508388) (← links)
- Undirected graphs rearrangeable by 2-length walks (Q4540050) (← links)
- (Q4630433) (← links)
- (Q4630485) (← links)
- (Q4630494) (← links)
- (Q4813143) (← links)
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network (Q5119373) (← links)
- Uniform emulations of Cartesian-product and Cayley graphs (Q5957297) (← links)
- A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures (Q6159910) (← links)
- Distributed learning of equilibria in a routing game (Q6483529) (← links)
- Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies (Q6497049) (← links)
