Computing and Combinatorics
type: Item
instance of: scholarly article
title: Computing and Combinatorics
zbMATH Open document ID: 1091.68080
author: Jung-Heum Park
published in: Lecture Notes in Computer Science
publication date: 2005-06-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 2176149
MaRDI profile type: MaRDI publication profile
full work available at URL: b99243
OpenAlex ID: W2491887524
DOI: 10.1007/B99243
Recommended article: Algorithms and Computation
Recommended article: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
Recommended article: General-demand disjoint path covers in a graph with faulty elements
Recommended article: One-to-one disjoint path covers in digraphs
Recommended article: Paired many-to-many disjoint path covers in faulty hypercubes
Recommended article: Many-to-many disjoint paths in hypercubes with faulty vertices
Recommended article: One-to-one disjoint path covers on alternating group graphs
Recommended article: Many-to-many disjoint paths in faulty hypercubes
Recommended article: Paired many-to-many disjoint path covers of hypercubes with faulty edges
description: scientific article; zbMATH DE number 2176149