Polynomial and Pseudo-Polynomial Time Algorithms for Different Classes of the Distance Critical Node Problem

AuthID
 P-00Q-2ZE
4
Author(s)
Aringhieri, R
·
Grosso, A
·
Document Type
Article
Year published
2019
Published
in DISCRETE APPLIED MATHEMATICS, ISSN: 0166-218X
Volume: 253, Pages: 103-121 (19)
Indexing
Wos®
Google Scholar®
Publication Identifiers
Wos: WOS:000454976200010
Source Identifiers
ISSN: 0166-218X
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service