Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs."

Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen (1992)

> Home

Details and statistics

DOI: 10.1016/0196-6774(92)90008-Z

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Bang-JensenMT92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Bang-JensenMT92
Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen:
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.