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...

An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties

Sensors (Basel, Switzerland), 2020-03, Vol.20 (7), p.1831

2020

Volltextzugriff (PDF)

Constructing independent spanning trees for locally twisted cubes

Theoretical computer science, 2011-05, Vol.412 (22), p.2237-2252

2011

Volltextzugriff (PDF)

All-to-all personalized exchange in generalized shuffle-exchange networks

Theoretical computer science, 2010-03, Vol.411 (16), p.1669-1684

2010

Volltextzugriff (PDF)

A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon

Information processing letters, 2014-10, Vol.114 (10), p.515-518

2014

Volltextzugriff (PDF)

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network

IEEE communications letters, 2006-04, Vol.10 (4), p.296-298

2006

Volltextzugriff (PDF)

Node-pancyclicity and edge-pancyclicity of hypercube variants

Information processing letters, 2007-04, Vol.102 (1), p.1-7

2007

Volltextzugriff (PDF)

Improved upper and lower bounds on the optimization of mixed chordal ring networks

Information processing letters, 2009-06, Vol.109 (13), p.757-762

2009

Volltextzugriff (PDF)

An efficient algorithm to find a double-loop network that realizes a given L-shape

Theoretical computer science, 2006-08, Vol.359 (1-3), p.69-76

2006

Volltextzugriff (PDF)

Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks

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

2007

Volltextzugriff (PDF)

Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs

Discrete Applied Mathematics, 2019-04, Vol.259, p.41-52

2019

Volltextzugriff (PDF)

Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes

2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009, p.17-22

2009

Volltextzugriff (PDF)

A necessary condition for a graph to be the visibility graph of a simple polygon

Theoretical computer science, 2002-04, Vol.276 (1), p.417-424

Chen, Chiuyuan

2002

Volltextzugriff (PDF)

Any maximal planar graph with only one separating triangle is Hamiltonian

Journal of combinatorial optimization, 2003-03, Vol.7 (1), p.79-86

CHIUYUAN CHEN

2003

Volltextzugriff (PDF)

On the existence of hyper-L triple-loop networks

Discrete mathematics, 2006-06, Vol.306 (12), p.1132-1138

2006

Volltextzugriff (PDF)

Optimal coloring for data collection in tree-based wireless sensor networks

Theoretical computer science, 2017-11, Vol.700, p.23-36

2017

Volltextzugriff (PDF)

Vertex and tree arboricities of graphs

Journal of combinatorial optimization, 2004-09, Vol.8 (3), p.295-306

2004

Volltextzugriff (PDF)

A simple algorithm to find the steps of double-loop networks

Discrete Applied Mathematics, 2002-09, Vol.121 (1), p.61-72

2002

Volltextzugriff (PDF)

Achieving Ultra Energy-efficient and Collision-free Data Collection in Wake-up Radio Enabled mIoT

ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020, p.1-6

2020

Volltextzugriff (PDF)

Receiver-Initiated Data Collection in Wake-Up Radio Enabled mIoT Networks: Achieving Collision-Free Transmissions by Hashing and Partitioning

IEEE transactions on green communications and networking, 2021-06, Vol.5 (2), p.868-883

2021

Volltextzugriff (PDF)

The existence of hyper-L triple-loop networks

Discrete mathematics, 2003-07, Vol.268 (1), p.287-291

2003

Volltextzugriff (PDF)

Disproving a conjecture on planar visibility graphs

Theoretical computer science, 2001, Vol.255 (1), p.659-665

2001

Volltextzugriff (PDF)

Equivalent nondegenerate L-shapes of double-loop networks

Networks, 2000-09, Vol.36 (2), p.118-125

2000

Volltextzugriff (PDF)

Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

Combinatorial Algorithms, 2013, p.115-126

2013

Volltextzugriff (PDF)

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network in honor of frank k. hwang's 65th birthday

IEEE communications letters, 2006-04, Vol.10 (4), p.296-298

2006

Volltextzugriff (PDF)

All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks

2009 Eighth International Conference on Networks, 2009, p.185-190

2009

Volltextzugriff (PDF)

1 – 25 von 39

Menü

Weitere Dienste

Einstellungen

An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties

Constructing independent spanning trees for locally twisted cubes

All-to-all personalized exchange in generalized shuffle-exchange networks

A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network

Node-pancyclicity and edge-pancyclicity of hypercube variants

Improved upper and lower bounds on the optimization of mixed chordal ring networks

An efficient algorithm to find a double-loop network that realizes a given L-shape

Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks

Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs

Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes

A necessary condition for a graph to be the visibility graph of a simple polygon

Any maximal planar graph with only one separating triangle is Hamiltonian

On the existence of hyper-L triple-loop networks

Optimal coloring for data collection in tree-based wireless sensor networks

Vertex and tree arboricities of graphs

A simple algorithm to find the steps of double-loop networks

Achieving Ultra Energy-efficient and Collision-free Data Collection in Wake-up Radio Enabled mIoT

Receiver-Initiated Data Collection in Wake-Up Radio Enabled mIoT Networks: Achieving Collision-Free Transmissions by Hashing and Partitioning

The existence of hyper-L triple-loop networks

Disproving a conjecture on planar visibility graphs

Equivalent nondegenerate L-shapes of double-loop networks

Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network in honor of frank k. hwang's 65th birthday

All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks

Suchergebnisse filtern