• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs (Extended abstract)

Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1991), On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs (Extended abstract), in Hsu, Wen-Lian; Lee, R.C.T., ISA '91 Algorithms 2nd International Symposium on Algorithms, Taipei, Republic of China [sic], December 16-18, 1991. Proceedings, Springer : Berlin, p. 190-198. http://dx.doi.org/10.1007/3-540-54945-5_62

Type
Communication / Conférence
Date
1991
Conference title
2nd International Symposium on Algorithms (ISA'91)
Conference date
1991-12
Conference city
Taipei
Conference country
Taïwan
Book title
ISA '91 Algorithms 2nd International Symposium on Algorithms, Taipei, Republic of China [sic], December 16-18, 1991. Proceedings
Book author
Hsu, Wen-Lian; Lee, R.C.T.
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
557
Published in
Berlin
ISBN
978-3-540-54945-1
Number of pages
396
Pages
190-198
Publication identifier
http://dx.doi.org/10.1007/3-540-54945-5_62
Metadata
Show full item record
Author(s)
Benkouar, A.
Manoussakis, Yannis
Paschos, Vangelis
Saad, Rachid
Subjects / Keywords
Euler; Hamilton; Graphs

Related items

Showing items related by title and author.

  • Thumbnail
    Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: some complexity results 
    Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1996) Article accepté pour publication ou publié
  • Thumbnail
    Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs 
    Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver (2019) Article accepté pour publication ou publié
  • Thumbnail
    On the Maximum Edge Coloring Problem (Extended Abstract) 
    Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis (2009) Communication / Conférence
  • Thumbnail
    On the approximation of NP-complete problems by using Boltzmann machine method. The cases of some covering and packing problems 
    Zissimopoulos, Vassilis; Paschos, Vangelis; Pekergin, Ferhan (1991) Communication / Conférence
  • Thumbnail
    On the approximation of NP-complete problems by using Boltzmann machine method: the cases of some covering and packing problems 
    Zissimopoulos, Vassilis; Paschos, Vangelis; Pekergin, Ferhan (1991) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo