Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Claude Bermond
Person information
- affiliation: University of Nice Sophia Antipolis, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c39]Jean-Claude Bermond, Frédéric Havet, Michel Cosnard:
Grabbing Olives on Linear Pizzas and Pissaladières. FUN 2022: 12:1-12:20- 2020
- [j86]Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain:
Distributed link scheduling in wireless networks. Discret. Math. Algorithms Appl. 12(5): 2050058:1-2050058:43 (2020) - [j85]Jean-Claude Bermond, Takako Kodate, Joseph Yu:
Gossiping with Interference Constraints in Radio Chain Networks. J. Inf. Process. 28: 889-902 (2020)
2010 – 2019
- 2019
- [j84]Jean-Claude Bermond, Fatima Zahra Moataz
:
On spectrum assignment in elastic optical tree-networks. Discret. Appl. Math. 257: 40-52 (2019) - [j83]Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities? Discret. Appl. Math. 270: 37-57 (2019) - 2018
- [c38]Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities?. FUN 2018: 6:1-6:21 - 2016
- [j82]Jean-Claude Bermond, Cristiana Gomes Huiban, Patricio Reyes:
Round weighting problem and gathering in radio networks with symmetrical interference. Discret. Math. Algorithms Appl. 8(2): 1650035:1-1650035:57 (2016) - [c37]Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. WAOA 2016: 40-51 - 2015
- [j81]Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu:
Data gathering and personalized broadcasting in radio grids with interference. Theor. Comput. Sci. 562: 453-475 (2015) - [j80]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
Finding disjoint paths in networks with star shared risk link groups. Theor. Comput. Sci. 579: 74-87 (2015) - 2014
- [j79]Júlio Araújo, Jean-Claude Bermond, Guillaume Ducoffe:
Eulerian and Hamiltonian dicycles in Directed hypergraphs. Discret. Math. Algorithms Appl. 6(1) (2014) - 2013
- [j78]Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes:
Gathering Radio Messages in the Path. Discret. Math. Algorithms Appl. 5(1) (2013) - [j77]Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes:
Directed acyclic graphs with the unique dipath property. Theor. Comput. Sci. 504: 5-11 (2013) - [j76]Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal time data gathering in wireless networks with multidirectional antennas. Theor. Comput. Sci. 509: 122-139 (2013) - [c36]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
SRLG-diverse routing with the star property. DRCN 2013: 163-170 - 2012
- [j75]Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski:
Weighted improper colouring. J. Discrete Algorithms 16: 53-66 (2012) - [j74]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. 444: 3-16 (2012) - [j73]Jean-Claude Bermond, Joseph G. Peters:
Optimal gathering in radio grids with interference. Theor. Comput. Sci. 457: 10-26 (2012) - [c35]Jean-Claude Bermond, Fahir Ö. Ergincan, Michel Syska:
Line Directed Hypergraphs. Cryptography and Security 2012: 25-34 - [c34]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
Diverse routing in networks with star SRLGs. StudentWorkshop@CoNEXT 2012: 23-24 - 2011
- [j72]Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau:
Traffic grooming in bidirectional WDM ring networks. Networks 58(1): 20-35 (2011) - [j71]Jean-Claude Bermond, Yeow Meng Chee, Nathann Cohen, Xiande Zhang:
The α-Arboricity of Complete Uniform Hypergraphs. SIAM J. Discret. Math. 25(2): 600-610 (2011) - [c33]Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski:
Weighted Improper Colouring. IWOCA 2011: 1-18 - [c32]Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. SIROCCO 2011: 306-317 - 2010
- [j70]Jean-Claude Bermond, Min-Li Yu:
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences. Ad Hoc Sens. Wirel. Networks 9(1-2): 109-127 (2010) - [j69]Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales:
Improper Coloring of Weighted Grid and Hexagonal Graphs. Discret. Math. Algorithms Appl. 2(3): 395-412 (2010) - [j68]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno:
Gathering with Minimum Completion Time in Sensor Tree Networks. J. Interconnect. Networks 11(1-2): 1-33 (2010) - [j67]Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau:
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. 24(2): 400-419 (2010) - [c31]Philippe J. Giabbanelli, Dorian Mazauric, Jean-Claude Bermond:
On the Average Path Length of Deterministic and Stochastics Recursive Networks. CompleNet 2010: 1-12 - [c30]Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain:
A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference. SIGMETRICS 2010: 345-346
2000 – 2009
- 2009
- [j66]Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Optimal gathering protocols on paths under interference constraints. Discret. Math. 309(18): 5574-5587 (2009) - [c29]Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano:
Minimum Delay Data Gathering in Radio Networks. ADHOC-NOW 2009: 69-82 - [c28]Eitan Altaian, Philippe Nain, Jean-Claude Bermond:
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. INFOCOM 2009: 1431-1439 - [c27]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado:
MPLS Label Stacking on the Line Network. Networking 2009: 809-820 - [c26]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO 2009: 57-71 - 2008
- [j65]Jean-Claude Bermond, David Coudert, Benjamin Lévêque:
Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. J. Interconnect. Networks 9(4): 471-486 (2008) - [c25]Jean-Claude Bermond, Min-Li Yu:
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. ADHOC-NOW 2008: 204-217 - [c24]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno:
Gathering with Minimum Delay in Tree Sensor Networks. SIROCCO 2008: 262-276 - 2007
- [j64]Jean-Claude Bermond, Min-Li Yu:
Vertex disjoint routings of cycles over tori. Networks 49(3): 217-225 (2007) - [j63]Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters:
Neighborhood Broadcasting in Hypercubes. SIAM J. Discret. Math. 21(4): 823-843 (2007) - [j62]Jean-Claude Bermond, Laurent Braud, David Coudert:
Traffic grooming on the path. Theor. Comput. Sci. 384(2-3): 139-151 (2007) - [c23]Jean-Claude Bermond, Michel Cosnard:
Minimum number of wavelengths equals load in a DAG without internal cycle. IPDPS 2007: 1-10 - [c22]Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes:
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. SIROCCO 2007: 261-273 - 2006
- [j61]Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth:
Fault tolerant on-board networks with priorities. Networks 47(1): 9-25 (2006) - [j60]Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes:
Hardness and Approximation of Gathering in Static Radio Networks. Parallel Process. Lett. 16(2): 165-184 (2006) - [c21]Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes:
Optimal Solution of the Maximum All Request Path Grooming Problem. AICT/ICIW 2006: 28 - [c20]Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Gathering Algorithms on Paths Under Interference Constraints. CIAC 2006: 115-126 - [c19]Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing:
Hardness and approximation of Gathering in static radio networks. PerCom Workshops 2006: 75-79 - 2005
- [j59]Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz:
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. SIAM J. Discret. Math. 19(2): 523-542 (2005) - [c18]Jean-Claude Bermond, Laurent Braud, David Coudert:
Traffic Grooming on the Path. SIROCCO 2005: 34-48 - 2004
- [j58]Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu:
Grooming in unidirectional rings: K4-e designs. Discret. Math. 284(1-3): 57-62 (2004) - 2003
- [j57]Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes:
The Power of Small Coalitions in Graphs. Discret. Appl. Math. 127(3): 399-414 (2003) - [j56]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129(1): 31-47 (2003) - [j55]R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu:
On Hamilton cycle decompositions of the tensor product of complete graphs. Discret. Math. 268(1-3): 49-58 (2003) - [j54]Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes:
Hierarchical Ring Network design. Theory Comput. Syst. 36(6): 663-682 (2003) - [j53]Jean-Claude Bermond, Stéphan Ceroi:
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks 41(2): 83-86 (2003) - [j52]Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes:
Directed virtual path layouts in ATM networks. Theor. Comput. Sci. 291(1): 3-28 (2003) - [c17]Jean-Claude Bermond, David Coudert:
Traffic grooming in unidirectional WDM ring networks using design theory. ICC 2003: 1402-1406 - 2002
- [j51]Jean-Claude Bermond, Éric Darrot, Olivier Delmas:
Design of fault-tolerant networks for satellites (TWTA redundancy). Networks 40(4): 202-207 (2002) - [c16]Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes:
Hierarchical Ring Network Design. SIROCCO 2002: 1-16 - 2001
- [j50]Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela:
A Broadcasting Protocol in Line Digraphs. J. Parallel Distributed Comput. 61(8): 1013-1032 (2001) - [c15]Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot:
Cycle Covering. SIROCCO 2001: 21-34 - [c14]Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot:
A note on cycle covering. SPAA 2001: 310-311 - 2000
- [j49]Jean-Claude Bermond, Susan Marshall, Min-Li Yu:
Improved Bounds for Gossiping in Mesh Bus Networks. J. Interconnect. Networks 1(1): 1-19 (2000) - [j48]Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec, Fred S. Roberts:
Optimal Orientations of Annular Networks. J. Interconnect. Networks 1(1): 21-46 (2000) - [j47]Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro:
Efficient collective communication in optical networks. Theor. Comput. Sci. 233(1-2): 165-189 (2000) - [c13]Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé:
Broadcasting in Hypercubes in the Circuit Switched Model. IPDPS 2000: 21-26
1990 – 1999
- 1999
- [e2]Cyril Gavoille, Jean-Claude Bermond, André Raspaud:
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999. Carleton Scientific 1999 [contents] - 1998
- [j46]Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes:
Hamilton Circuits in the Directed Wrapped Butterfly Network. Discret. Appl. Math. 84(1-3): 21-42 (1998) - [j45]Jean-Claude Bermond, Luisa Gargano, Stephane Perennes:
Optimal Sequential Gossiping by Short Messages. Discret. Appl. Math. 86(2-3): 145-155 (1998) - [j44]Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes:
Hamilton Cycle Decomposition of the Butterfly Network. Parallel Process. Lett. 8(3): 371-385 (1998) - [j43]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fast Gossiping by Short Messages. SIAM J. Comput. 27(4): 917-941 (1998) - [c12]Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes:
Directed Virtual Path Layouts in ATM Networks. DISC 1998: 75-88 - 1997
- [j42]Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes:
A Note on the Dimensionality of Modified Knö;del Graphs. Int. J. Found. Comput. Sci. 8(2): 109-116 (1997) - [j41]Jean-Claude Bermond, Zhen Liu, Michel Syska:
Mean eccentricities of de Bruijn networks. Networks 30(3): 187-203 (1997) - [j40]Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan:
De Bruijn and Kautz bus networks. Networks 30(3): 205-218 (1997) - [c11]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG 1997: 52-64 - 1996
- [j39]Jean-Claude Bermond, Fahir Ö. Ergincan:
Bus Interconnection Networks. Discret. Appl. Math. 68(1-2): 1-15 (1996) - [j38]Jean-Claude Bermond, Claudine Peyrat, I. Sakho, Maurice Tchuenté:
Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays. J. Parallel Distributed Comput. 33(1): 69-75 (1996) - [c10]Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela:
Induced Broadcasting Algorithms in Iterated Line Digraphs. Euro-Par, Vol. I 1996: 313-324 - [c9]Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro:
Efficient Collective Communication in Optical Networks. ICALP 1996: 574-585 - [c8]Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes:
Tight Bounds on the Size of 2-Monopolies. SIROCCO 1996: 170-179 - 1995
- [j37]Jean-Claude Bermond, Francesc Comellas, D. Frank Hsu:
Distributed Loop Computer Networks: A Survey. J. Parallel Distributed Comput. 24(1): 2-10 (1995) - [j36]Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters:
Antepenultimate broadcasting. Networks 26(3): 125-137 (1995) - [c7]Jean-Claude Bermond, Takako Kodate, Stephane Perennes:
Gossiping in Cayley Graphs by Packets. Combinatorics and Computer Science 1995: 301-315 - [c6]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fast Gossiping by Short Messages. ICALP 1995: 135-146 - [c5]Jean-Claude Bermond, David Peleg:
The Power of Small Coalitions in Graphs. SIROCCO 1995: 173-184 - [c4]Jean-Claude Bermond, Stephane Perennes:
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. SIROCCO 1995: 199-209 - 1994
- [j35]Jean-Claude Bermond, Pierre Fraigniaud:
Broadcasting and Gossiping in de Bruijn Networks. SIAM J. Comput. 23(1): 212-225 (1994) - [c3]Jean-Claude Bermond, Johny Bond, Selma Djelloul:
Dense bus networks of diameter 2. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 9-18 - 1993
- [j34]Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat:
Connectivity of kautz networks. Discret. Math. 114(1-3): 51-62 (1993) - [j33]Jean-Claude Bermond, Pavol Hell:
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory 17(5): 647-655 (1993) - 1992
- [j32]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Sparse broadcast graphs. Discret. Appl. Math. 36(2): 97-130 (1992) - [j31]Jean-Claude Bermond:
Foreword. Discret. Appl. Math. 37/38: 1 (1992) - [j30]Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Table of Large (Delta, D)-Graphs. Discret. Appl. Math. 37/38: 575-577 (1992) - [j29]Jean-Claude Bermond, Philippe Michallon, Denis Trystram:
Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Comput. 18(6): 639-648 (1992) - [j28]Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater:
Construction of Large Packet Radio Networks. Parallel Process. Lett. 2: 3-12 (1992) - [j27]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Broadcasting in Bounded Degree Graphs. SIAM J. Discret. Math. 5(1): 10-24 (1992) - 1991
- [j26]Jean-Claude Bermond, Dvora Tzvieli:
Minimal diameter double-loop networks: Dense optimal families. Networks 21(1): 1-9 (1991) - 1990
- [j25]Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu:
Existence of Resolvable Path Designs. Eur. J. Comb. 11(3): 205-211 (1990) - [j24]Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu:
On Resolvable Mixed Path Designs. Eur. J. Comb. 11(4): 313-318 (1990)
1980 – 1989
- 1989
- [j23]Jean-Claude Bermond, Karima Berrada, Johny Bond:
Extensions of networks with given diameter. Discret. Math. 75(1-3): 31-40 (1989) - [j22]Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat:
Large fault-tolerant interconnection networks. Graphs Comb. 5(1): 107-123 (1989) - [j21]Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo:
Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Theory, Ser. B 46(2): 142-153 (1989) - [j20]Jean-Claude Bermond, Claudine Peyrat:
Induced Subgraphs of the Power of a Cycle. SIAM J. Discret. Math. 2(4): 452-455 (1989) - [j19]Jean-Claude Bermond, Jean-Michel Fourneau:
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. Theor. Comput. Sci. 64(2): 191-201 (1989) - [e1]Jean-Claude Bermond, Michel Raynal:
Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings. Lecture Notes in Computer Science 392, Springer 1989, ISBN 3-540-51687-5 [contents] - 1988
- [c2]Jean-Claude Bermond, Jean-Michel Fourneau:
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. ICPP (1) 1988: 187-190 - 1987
- [j18]Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie:
Equivalence of Multistage Interconnection Networks. Inf. Process. Lett. 26(1): 45-50 (1987) - [c1]Jean-Claude Bermond, Jean-Claude König, Michel Raynal:
General and Efficient Decentralized Consensus Protocols. WDAG 1987: 41-56 - 1986
- [j17]Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Strategies for Interconnection Networks: Some Methods from Graph Theory. J. Parallel Distributed Comput. 3(4): 433-449 (1986) - 1984
- [j16]Jean-Claude Bermond, Michel Las Vergnas:
Regular factors in nearly regular graphs. Discret. Math. 50: 9-13 (1984) - [j15]Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche:
On linear k-arboricity. Discret. Math. 52(2-3): 123-132 (1984) - [j14]Jean-Claude Bermond, Charles Delorme, G. Farhi:
Large graphs with given degree and diameter. II. J. Comb. Theory, Ser. B 36(1): 32-48 (1984) - 1983
- [j13]Jean-Claude Bermond, Bill Jackson, François Jaeger:
Shortest coverings of graphs with cycles. J. Comb. Theory, Ser. B 35(3): 297-308 (1983) - 1982
- [j12]Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Tables of Large Graphs with Given Degree and Diameter. Inf. Process. Lett. 15(1): 10-13 (1982) - 1981
- [j11]