The following pages link to Jean-Claude Bermond (Q216124):
Displaying 50 items.
- Optimal time data gathering in wireless networks with multidirectional antennas (Q392209) (← links)
- Directed acyclic graphs with the unique dipath property (Q393144) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Data gathering and personalized broadcasting in radio grids with interference (Q476894) (← links)
- (Q685653) (redirect page) (← links)
- Connectivity of Kautz networks (Q685656) (← links)
- Optimal gathering in radio grids with interference (Q714836) (← links)
- On linear k-arboricity (Q761470) (← links)
- (Q793747) (redirect page) (← links)
- Large graphs with given degree and diameter. II (Q793749) (← links)
- Regular factors in nearly regular graphs (Q795844) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- Existence of resolvable path designs (Q923105) (← links)
- On resolvable mixed path designs (Q923106) (← links)
- Optimal gathering protocols on paths under interference constraints (Q1045041) (← links)
- Hamiltonian decomposition of Cayley graphs of degree 4 (Q1089003) (← links)
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks (Q1117906) (← links)
- A graph theoretical approach to equivalence of multistage interconnection networks (Q1119597) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- On the maximum number of edges in a hypergraph whose linegraph contains no cycle (Q1143416) (← links)
- Tables of large graphs with given degree and diameter (Q1164611) (← links)
- Longest paths in digraphs (Q1165864) (← links)
- Sparse broadcast graphs (Q1192945) (← links)
- Broadcasting in wraparound meshes with parallel monodirectional links (Q1199095) (← links)
- Table of large \(({\Delta{}}, D)\)-graphs (Q1199460) (← links)
- Decomposition of the complete directed graph into k-circuits (Q1232420) (← links)
- Line graphs of hypergraphs. I (Q1241758) (← links)
- \(G\)-decomposition of \(K_n\), where G has four vertices or less (Q1245839) (← links)
- Resolvable decomposition of \(K^*_n\) (Q1259605) (← links)
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Symmetric flows and broadcasting in hypercubes (Q1296143) (← links)
- Hamilton circuits in the directed wrapped Butterfly network (Q1392560) (← links)
- On Hamilton cycle decompositions of the tensor product of complete graphs (Q1398255) (← links)
- Deadlock prevention by acyclic orientations (Q1399106) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Hierarchical ring network design (Q1762997) (← links)
- An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits (Q1843575) (← links)
- Some Ramsey nu mbers for directed graphs (Q1846431) (← links)
- Directed virtual path layouts in ATM networks (Q1870524) (← links)
- Grooming in unidirectional rings: \(K_{4}-e\) designs (Q1876673) (← links)
- Bus interconnection networks (Q1917343) (← links)
- Weighted improper colouring (Q1932354) (← links)
- How long does it take for all users in a social network to choose their communities? (Q2334040) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- Well-Balanced Designs for Data Placement (Q2808799) (← links)
- Line Directed Hypergraphs (Q2889750) (← links)
- Bin Packing with Colocations (Q2971155) (← links)
- Grands Graphes De Degré Et Diamètre Fixés (Q3043184) (← links)
