UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Component connectivity of the hypercubes

International journal of computer mathematics, 2012-01, Vol.89 (2), p.137-145

2012

Volltextzugriff (PDF)

Fault-tolerant hamiltonian connectivity of the WK-recursive networks

Information sciences, 2014-07, Vol.271, p.236-245

2014

Volltextzugriff (PDF)

Cycles in cube-connected cycles graphs

Discrete Applied Mathematics, 2014-04, Vol.167, p.163-171

2014

Volltextzugriff (PDF)

Diameter variability of cycles and tori

Information sciences, 2008-07, Vol.178 (14), p.2960-2967

2008

Volltextzugriff (PDF)

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks

2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009, p.592-595

2009

Volltextzugriff (PDF)

On the extremal number of edges in hamiltonian connected graphs

Applied mathematics letters, 2010, Vol.23 (1), p.26-29

2010

Volltextzugriff (PDF)

Conditional fault hamiltonian connectivity of the complete graph

Information processing letters, 2009-05, Vol.109 (12), p.585-588

2009

Volltextzugriff (PDF)

Mutually orthogonal hamiltonian connected graphs

Applied mathematics letters, 2009-09, Vol.22 (9), p.1429-1431

2009

Volltextzugriff (PDF)

On mutually independent hamiltonian paths

Applied mathematics letters, 2006-04, Vol.19 (4), p.345-350

2006

Volltextzugriff (PDF)

Multiple-edge-fault tolerance with respect to hypercubes

IEEE transactions on parallel and distributed systems, 1997-02, Vol.8 (2), p.187-192

1997

Volltextzugriff (PDF)

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

International journal of computer mathematics, 2009-01, Vol.86 (1), p.57-66

2009

Volltextzugriff (PDF)

On cubic 2-independent Hamiltonian connected graphs

Journal of combinatorial optimization, 2007-10, Vol.14 (2-3), p.275-294

2007

Volltextzugriff (PDF)

Changing the Diameter in a Diagonal Mesh Network

Journal of Information Science and Engineering, 2013-03, Vol.29 (2), p.193-208

2013

Volltextzugriff (PDF)

A note on edge fault tolerance with respect to hypercubes

Applied mathematics letters, 2005-10, Vol.18 (10), p.1125-1128

2005

Volltextzugriff (PDF)

Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks

Journal of Information Science and Engineering, 2009-11, Vol.25 (6), p.1855-1862

2009

Volltextzugriff (PDF)

On the Extremal Number of Edges in Hamiltonian Graphs

Journal of Information Science and Engineering, 2011-09, Vol.27 (5), p.1659-1665

2011

Volltextzugriff (PDF)

FAULT-TOLERANT HAMILTONIAN LACEABILITY AND FAULT-TOLERANT CONDITIONAL HAMILTONIAN FOR BIPARTITE HYPERCUBE-LIKE NETWORKS

Journal of interconnection networks, 2009-09, Vol.10 (3), p.243-251

2009

Volltextzugriff (PDF)

A note on the minimum cut cover of graphs

Operations research letters, 1994-05, Vol.15 (4), p.193-194

1994

Volltextzugriff (PDF)

A NEW ISOMORPHIC DEFINITION OF THE CROSSED CUBE AND ITS SPANNING CONNECTIVITY

Journal of interconnection networks, 2009-03, Vol.10 (1n02), p.149-166

2009

Volltextzugriff (PDF)

Facile fabrication of micro-grooves based photonic crystals towards anisotropic angle-independent structural colors and polarized multiple reflections

Science bulletin, 2017-07, Vol.62 (13), p.938-942

2017

Volltextzugriff (PDF)

Optimal k-Fault-Tolerant Networks for Token Rings

Journal of Information Science and Engineering, 2000-05, Vol.16 (3), p.381-390

2000

Volltextzugriff (PDF)

Transmitting on various network topologies

Networks, 1996-03, Vol.27 (2), p.145-157

1996

Volltextzugriff (PDF)

The Recognition of Double Euler Trails in Series-Parallel Networks

Journal of algorithms, 1998-08, Vol.28 (2), p.216-257

1998

Volltextzugriff (PDF)

Projective torus networks

Computing and Combinatorics, 2006, p.451-459

2006

Volltextzugriff (PDF)

Design of Smart Mess Application Using Ubiquitous Computing

2018 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW), 2018, p.1-2

2018

Volltextzugriff (PDF)

1 – 25 von 57

Menü

Weitere Dienste

Einstellungen

Component connectivity of the hypercubes

Fault-tolerant hamiltonian connectivity of the WK-recursive networks

Cycles in cube-connected cycles graphs

Diameter variability of cycles and tori

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks

On the extremal number of edges in hamiltonian connected graphs

Conditional fault hamiltonian connectivity of the complete graph

Mutually orthogonal hamiltonian connected graphs

On mutually independent hamiltonian paths

Multiple-edge-fault tolerance with respect to hypercubes

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

On cubic 2-independent Hamiltonian connected graphs

Changing the Diameter in a Diagonal Mesh Network

A note on edge fault tolerance with respect to hypercubes

Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks

On the Extremal Number of Edges in Hamiltonian Graphs

FAULT-TOLERANT HAMILTONIAN LACEABILITY AND FAULT-TOLERANT CONDITIONAL HAMILTONIAN FOR BIPARTITE HYPERCUBE-LIKE NETWORKS

A note on the minimum cut cover of graphs

A NEW ISOMORPHIC DEFINITION OF THE CROSSED CUBE AND ITS SPANNING CONNECTIVITY

Facile fabrication of micro-grooves based photonic crystals towards anisotropic angle-independent structural colors and polarized multiple reflections

Optimal k-Fault-Tolerant Networks for Token Rings

Transmitting on various network topologies

The Recognition of Double Euler Trails in Series-Parallel Networks

Projective torus networks

Design of Smart Mess Application Using Ubiquitous Computing

Suchergebnisse filtern