Lih-Hsing Hsu

Proceedings of the 20th IEEE/ACIS International Conference on Software Engineering, 2019

2018

On the spanning connectivity of the generalized Petersen graphs P(n,3).

[BibT_eX]

[DOI]

Discret. Math., 2018

An Augmented Pancyclicity Problem of Crossed Cubes.

[BibT_eX]

[DOI]

Hon-Chan Chen

Comput. J., 2018

Fault-Hamiltonicity of Cartesian products of directed cycles.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

2017

Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2017

The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Applied Computing and Information Technology, 2017

2016

On the Robust Approach to Data Inconsistency Detection of Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

A Framework of Cycle-Based Clustering on the Crossed Cube Architecture.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

On Developing the Learning Game for Graph Theory: A New Design Model Considering the Learners' Reflexiveness.

[BibT_eX]

[DOI]

Meng-Chien Yang

Zi-Ting Xu

Proceedings of the 5th IIAI International Congress on Advanced Applied Informatics, 2016

2015

On Hamiltonian properties of unidirectional hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Conditional Matching Preclusion For The Star Graphs.

[BibT_eX]

Ars Comb., 2015

2014

On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube.

[BibT_eX]

[DOI]

Cheng-Kuan Lin

J. Comb. Optim., 2014

Fault-tolerant hamiltonian connectivity of the WK-recursive networks.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Cycles in cube-connected cycles graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Conditional Fault Hamiltonicity of the Star Graph.

[BibT_eX]

Ars Comb., 2014

Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems and Applications, 2014

Conditional Connectivity with Distance Requirement on Hypercube.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013

Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2013

4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4).

[BibT_eX]

[DOI]

Math. Comput. Model., 2013

Disjoint cycles in hypercubes with prescribed vertices in each cycle.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs.

[BibT_eX]

Ars Comb., 2013

The spanning laceability on the faulty bipartite hypercube-like networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2013

2012

The paths embedding of the arrangement graphs with prescribed vertices in given position.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Component connectivity of the hypercubes.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2012

Solution to an open problem on 4-ordered Hamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Mutually Independent Hamiltonian Cycles in Some Graphs.

[BibT_eX]

Ars Comb., 2012

Super Spanning Connectivity of Augmented Cubes.

[BibT_eX]

Ars Comb., 2012

Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs.

[BibT_eX]

Ars Comb., 2012

The g-good-neighbor conditional diagnosability of hypercube under PMC model.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2012

2011

On 4-ordered 3-regular graphs.

[BibT_eX]

[DOI]

Math. Comput. Model., 2011

On the Extremal Number of Edges in Hamiltonian Graphs.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2011

Fault-free mutually independent Hamiltonian cycles of faulty star graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2011

Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs.

[BibT_eX]

[DOI]

Yung-Ling Lai

Da-Chung Yu

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

The spanning connectivity of line graphs.

[BibT_eX]

[DOI]

Po-Yi Huang

Appl. Math. Lett., 2011

Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions.

[BibT_eX]

[DOI]

Hon-Chan Chen

Appl. Math. Comput., 2011

Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2010

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance.

[BibT_eX]

[DOI]

J. Supercomput., 2010

4-Ordered Hamiltonicity for Some Chordal Ring Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2010

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2010

Super Spanning Connectivity of the Fully Connected cubic Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2010

The panpositionable panconnectedness of augmented cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2010

The construction of mutually independent Hamiltonian cycles in bubble-sort graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

The 3*-connected property of pyramid networks.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2010

On the extremal number of edges in hamiltonian connected graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2010

Mutually independent bipanconnected property of hypercube.

[BibT_eX]

[DOI]

Yuan-Kang Shih

Appl. Math. Comput., 2010

Two Spanning Disjoint Paths with Required Length in Arrangement Graphs.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

The Diagnosability of g-good-neighbor Conditional-Faulty Hypercube under PMC Model.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

2009

The super spanning connectivity and super spanning laceability of the enhanced hypercubes.

[BibT_eX]

[DOI]

J. Supercomput., 2009

On the bipanpositionable bipanconnectedness of hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Embedding paths of variable lengths into hypercubes with conditional link-faults.

[BibT_eX]

[DOI]

Parallel Comput., 2009

Conditional diagnosability of hypercubes under the comparison diagnosis model.

[BibT_eX]

[DOI]

J. Syst. Archit., 2009

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transposition Trees.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

A New Isomorphic Definition of the Crossed Cube and its Spanning Connectivity.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Long paths in hypercubes with conditional node-faults.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Conditional fault hamiltonian connectivity of the complete graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

The Spanning Connectivity of the Burnt Pancake Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Mutually independent hamiltonian cycles for the pancake graphs and the star graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Globally bi-3*-connected graphs.

[BibT_eX]

[DOI]

Hong-Chun Hsu

Discret. Math., 2009

On the spanning fan-connectivity of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

The bipanpositionable bipancyclic property of the hypercube.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2009

Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2009

Mutually orthogonal hamiltonian connected graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks.

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008

Mutually independent hamiltonian cycles of binary wrapped butterfly graphs.

[BibT_eX]

[DOI]

Tz-Liang Kueng

Tyne Liang

Math. Comput. Model., 2008

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2008

Strong Menger connectivity with conditional faults on the class of hypercube-like networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position.

[BibT_eX]

[DOI]

Chung-Meng Lee

Inf. Process. Lett., 2008

On spanning connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Hyper-Hamiltonian generalized Petersen graphs.

[BibT_eX]

[DOI]

Ta-Cheng Mai

Comput. Math. Appl., 2008

Panpositionable hamiltonicity and panconnectivity of the arrangement graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2008

Fault-tolerant hamiltonian connectedness of cycle composition networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2008

Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Parallel Architectures, 2008

On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Parallel Architectures, 2008

2007

On the spanning connectivity and spanning laceability of hypercube-like networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Panpositionable hamiltonicity of the alternating group graphs.

[BibT_eX]

[DOI]

Networks, 2007

Highly fault-tolerant cycle embeddings of hypercubes.

[BibT_eX]

[DOI]

Ming-Chien Yang

J. Syst. Archit., 2007

Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes.

[BibT_eX]

[DOI]

Ming-Chien Yang

J. Parallel Distributed Comput., 2007

Hamiltonian laceability of Faulty Hypercubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2007

Hamiltonicity of hypercubes with a constraint of required and faulty edges.

[BibT_eX]

[DOI]

Shu-Chung Liu

Yeong-Nan Yeh

J. Comb. Optim., 2007

On cubic 2-independent Hamiltonian connected graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

On the equitable k *-laceability of hypercubes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

The globally Bi-3*-connected property of the honeycomb rectangular torus.

[BibT_eX]

[DOI]

Inf. Sci., 2007

Edge-bipancyclicity of conditional faulty hypercubes.

[BibT_eX]

[DOI]

Lun-Min Shih

Inf. Process. Lett., 2007

Node-pancyclicity and edge-pancyclicity of hypercube variants.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On the spanning connectivity of graphs.

[BibT_eX]

[DOI]

Cheng-Kuan Lin

Hua-Min Huang

Discret. Math., 2007

2006

On the spanning w-wide diameter of the star graph.

[BibT_eX]

[DOI]

Networks, 2006

Mutually Independent Hamiltonian Paths and Cycles in Hypercubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2006

On embedding cycles into faulty twisted cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2006

The Spanning Connectivity of the (n, k)-star Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Cubic planar hamiltonian graphs of various types.

[BibT_eX]

[DOI]

Kung-Ming Hsu

Discret. Math., 2006

Panpositionable Hamiltonian Graphs.

[BibT_eX]

Ars Comb., 2006

On mutually independent hamiltonian paths.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2006

A recursively construction scheme for super fault-tolerant hamiltonian graphs.

[BibT_eX]

[DOI]

Y-Chuang Chen

Appl. Math. Comput., 2006

The Globally Bi-3*-Connected Property of the Brother Trees.

[BibT_eX]

[DOI]

Po-Chun Kuo

Proceedings of the 2006 Joint Conference on Information Sciences, 2006

2005

The super connectivity of the pancake graphs and the super laceability of the star graphs.

[BibT_eX]

[DOI]

Cheng-Kuan Lin

Hua-Min Huang

Theor. Comput. Sci., 2005

Conditional Diagnosability Measures for Large Multiprocessor Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

Honeycomb rectangular disks.

[BibT_eX]

[DOI]

Parallel Comput., 2005

Fault hamiltonicity of augmented cubes.

[BibT_eX]

[DOI]

Parallel Comput., 2005

Mutually independent hamiltonian paths in star networks.

[BibT_eX]

[DOI]

Networks, 2005

Fault-Tolerant Pancyclicity of the Möbius Cubes.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

A note on edge fault tolerance with respect to hypercubes.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2005

The globally bi-3* and hyper bi-3* connectedness of the spider web networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2005

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2005

Cycles in Highly Faulty Hypercubes.

[BibT_eX]

Ming-Chien Yang

Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

2004

The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

Hyper hamiltonian laceability on edge fault star graph.

[BibT_eX]

[DOI]

Tseng-Kuei Li

Inf. Sci., 2004

The super-connected property of recursive circulant graphs.

[BibT_eX]

[DOI]

Chang-Hsiung Tsai

Inf. Process. Lett., 2004

The super laceability of the hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

On some super fault-tolerant Hamiltonian graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2004

The Spanning Diameter of the Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Ring Embedding in Faulty Augmented Cubes.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2003

Cycle embedding in faulty wrapped butterfly graphs.

[BibT_eX]

[DOI]

Networks, 2003

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs.

[BibT_eX]

[DOI]

Networks, 2003

Fault-tolerant cycle-embedding of crossed cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Ring embedding in faulty pancake graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Super-connectivity and super-edge-connectivity for some interconnection networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2003

2002

Fault-Tolerant Hamiltonicity of Twisted Cubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2002

Hamiltonian Properties of Faulty Recursive Circulant Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2002

Fault-tolerant hamiltonian laceability of hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Optimal 1-edge fault-tolerant designs for ladders.

[BibT_eX]

[DOI]

Yen-Chu Chuang

Chung-Haw Chang

Inf. Process. Lett., 2002

On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

A note on the ultimate categorical matching in a graph.

[BibT_eX]

[DOI]

Discret. Math., 2002

Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs.

[BibT_eX]

[DOI]

Kao-Yung Liang

Proceedings of the International Symposium on Parallel Architectures, 2002

Hamiltonian laceability on edge fault star graph.

[BibT_eX]

[DOI]

Tseng-Kuei Li

Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes.

[BibT_eX]

[DOI]

Chien-Min Wang

Yomin Hou

Proceedings of the Euro-Par 2002, 2002

2001

Optimal Processor Mapping for Linear-Complement Communication on Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2001

On the construction of combined k-fault-tolerant Hamiltonian graphs.

[BibT_eX]

[DOI]

Networks, 2001

A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n).

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2001

Routing properties of supercubes.

[BibT_eX]

[DOI]

Jyh-Jian Sheu

Inf. Sci., 2001

The shuffle-cubes and their generalization.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs.

[BibT_eX]

[DOI]

Chung-Haw Chang

Yen-Chu Chuang

Discret. Math., 2001

2000

On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2000

Edge Congestion and Topological Properties of Crossed Cubes.

[BibT_eX]

[DOI]

Chien-Ping Chang

IEEE Trans. Parallel Distributed Syst., 2000

Construction schemes for fault-tolerant Hamiltonian graphs.

[BibT_eX]

[DOI]

Networks, 2000

Optimum Congested Routing Strategy on Twisted Cubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2000

Optimal k-Fault-Tolerant Networks for Token Rings.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2000

Fault-Free Hamiltonian Cycle in Faulty Möbius Cubes.

[BibT_eX]

[DOI]

Computación y Sistemas, 2000

1999

Fault Diameter for Subercubes.

[BibT_eX]

[DOI]

Jyh-Jian Sheu

Parallel Process. Lett., 1999

Topological Properties of Twisted Cube.

[BibT_eX]

[DOI]

Chien-Ping Chang

Jyh-Nan Wang

Inf. Sci., 1999

The correct diameter of trivalent Cayley graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

1998

The Recognition of Double Euler Trails in Series-Parallel Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Optimal 1-Hamiltonian Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Fault Tolerant Token Ring Embedding in Double Loop Networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Depth Contention-free Broadcasting on Torus Networks.

[BibT_eX]

[DOI]

Yomin Hou

Chien-Min Wang

Proceedings of the 12th international conference on Supercomputing, 1998

Christmas Tree: A 1-Fault-Tolerant Network for Token Rings.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel and Distributed Systems, 1998

Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel and Distributed Systems, 1998

A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 1997

Faithful 1-Edge Fault Tolerant Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

A new shortest path routing algorithm and embedding cycles of crossed cube.

[BibT_eX]

[DOI]

Chien-Ping Chang

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Projective Torus Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

On minimal cost-reliability ratio spanning trees and related problems.

[BibT_eX]

[DOI]

Yung-Cheng Chang

Oper. Res. Lett., 1996

A response to Volgenant's Addendum on the most vital edges.

[BibT_eX]

[DOI]

Networks, 1996

Transmitting on various network topologies.

[BibT_eX]

[DOI]

Networks, 1996

Maximum and Minimum Matchings for Seriew-Parallel Networks.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 1996

A classification of graph capacity functions.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

1995

Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives.

[BibT_eX]

[DOI]

Yung-Cheng Chang

Inf. Process. Lett., 1995

1994

1-Edge Fault-Tolerant designs for Meshes.

[BibT_eX]

[DOI]

Ray-Shyng Chou

Parallel Process. Lett., 1994

A note on the minimum cut cover of graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

1993

Matching Polynomials of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

The most vital edges of matching in a bipartite graph.

[BibT_eX]

[DOI]

Networks, 1993

1992

Parallel algorithms for finding the most vital edge with respect to minimum spanning tree.

[BibT_eX]

[DOI]

Peng-Fei Wang

Chu-Tao Wu

Parallel Comput., 1992

The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs.

[BibT_eX]

[DOI]

Rong-Hong Jan

Yueh-Ying Lee

BIT, 1992

Data Structure for Graph Representations of a Network Having Double Euler Trails.

[BibT_eX]

Jeng-Yan Hwang

Proceedings of the Algorithms, Software, Architecture, 1992

Maximum and Minimum Matchings for Series-Parallel Networks.

[BibT_eX]

Proceedings of the Computing and Information, 1992

1991

Maximum independent number for series-parallel networks.

[BibT_eX]

[DOI]

Networks, 1991

Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

Undordered Tree Contraction.

[BibT_eX]

[DOI]

Jones J. J. Wang

Proceedings of the Advances in Computing and Information, 1991

1990

Generalized homomorphism graph functions.

[BibT_eX]

[DOI]

Discret. Math., 1990

1987

A class of additive multiplicative graph functions.

[BibT_eX]

[DOI]

Chiuyuan Chen

En-Yih Jean

Discret. Math., 1987

1985

Dependence of tree copy functions.

[BibT_eX]

[DOI]

Discret. Math., 1985

1983

On a multiplicative graph function conjecture.

[BibT_eX]

[DOI]