Random generation of tournaments and asymmetric graphs with given out-degrees

Author： Charon I.   Germa A.   Hudry O.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.95, Iss.2, 1996-12, pp. : 411-419

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Random geometric graphs for modelling the pore space of fibre-based materials

By Thiedmann Ralf   Manke Ingo   Lehnert Werner   Schmidt Volker  

Journal of Materials Science, Vol. 46, Iss. 24, 2011-12 ,pp. : 7745-7759

Springer Publishing Company

Access to resources Recommend Favorite

A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

By Kaji T.   Ohuchi A.  

European Journal of Operational Research, Vol. 112, Iss. 1, 1999-01 ,pp. : 147-157

Elsevier

Access to resources Recommend Favorite

Comparing the efficacy of ranking methods for multiple round-robin tournaments

By Mendonca D.   Raghavachari M.  

European Journal of Operational Research, Vol. 123, Iss. 3, 2000-06 ,pp. : 593-605

Elsevier

Access to resources Recommend Favorite

Reasoning with contextual graphs

By Brezillon P.   Pasquier L.   Pomerol J.-C.  

European Journal of Operational Research, Vol. 136, Iss. 2, 2002-01 ,pp. : 290-298

Elsevier

Access to resources Recommend Favorite

Graphs and Scheduling (ECCO XIII)

By Improta G.   Martello S.  

European Journal of Operational Research, Vol. 142, Iss. 2, 2002-10 ,pp. : 219-220

Elsevier

Access to resources Recommend Favorite