Jung-Heum Park

From MaRDI portal
Person:266948

Available identifiers

zbMath Open park.jung-heumMaRDI QIDQ266948

List of research outcomes

PublicationDate of PublicationType
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults2023-08-16Paper
Torus-like graphs and their paired many-to-many disjoint path covers2020-12-29Paper
Characterization of interval graphs that are unpaired 2-disjoint path coverable2020-04-22Paper
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs2019-08-07Paper
Disjoint path covers joining prescribed source and sink sets in interval graphs2019-05-29Paper
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph2018-12-05Paper
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$2017-10-19Paper
Disjoint path covers with path length constraints in restricted hypercube-like graphs2017-09-07Paper
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements2017-08-08Paper
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph2016-12-28Paper
Paired many-to-many disjoint path covers in restricted hypercube-like graphs2016-05-18Paper
Algorithms for finding disjoint path covers in unit interval graphs2016-04-07Paper
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs2016-01-28Paper
Ore-type degree conditions for disjoint path covers in simple graphs2015-12-08Paper
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs2015-09-23Paper
Many-to-many two-disjoint path covers in cylindrical and toroidal grids2015-04-28Paper
The bicube: an interconnection of two hypercubes2015-03-25Paper
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks2014-08-27Paper
Disjoint path covers in cubes of connected graphs2014-05-06Paper
Single-source three-disjoint path covers in cubes of connected graphs2014-04-11Paper
Many-to-many two-disjoint path covers in restricted hypercube-like graphs2014-03-28Paper
Paired many-to-many disjoint path covers in faulty hypercubes2014-01-13Paper
Strong matching preclusion under the conditional fault model2013-04-25Paper
General-demand disjoint path covers in a graph with faulty elements2013-01-22Paper
Strong matching preclusion2012-01-09Paper
Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements2011-09-12Paper
Fault-Hamiltonicity of Product Graph of Path and Cycle2011-03-18Paper
Conditional matching preclusion for hypercube-like interconnection networks2009-07-10Paper
Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)2008-03-05Paper
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements2007-06-06Paper
Algorithms and Computation2005-12-22Paper
Computing and Combinatorics2005-06-15Paper
Computing and Combinatorics2005-06-15Paper
Longest paths and cycles in faulty star graphs2005-01-31Paper
https://portal.mardi4nfdi.de/entity/Q49449842000-08-03Paper
Embedding trees in recursive circulants1997-04-13Paper
An optimal algorithm for finding the edge visibility polygon under limited visibility1997-02-28Paper
On the construction of regular minimal broadcast digraphs1994-04-05Paper
On the number of guard edges of a polygon1994-01-19Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jung-Heum Park