Skip to main content

Research Repository

Advanced Search

Outputs (3168)

The k-in-a-path problem for claw-free graphs (2012)
Journal Article
Fiala, J., Kamiński, M., Lidický, B., & Paulusma, D. (2012). The k-in-a-path problem for claw-free graphs. Algorithmica, 62(1-2), 499-519. https://doi.org/10.1007/s00453-010-9468-z

The k-in-a-Path problem is to test whether a graph contains an induced path spanning k given vertices. This problem is NP-complete in general graphs, already when k=3. We show how to solve it in polynomial time on claw-free graphs, when k is an arbit... Read More about The k-in-a-path problem for claw-free graphs.

Finding induced paths of given parity in claw-free graphs (2012)
Journal Article
Hof van 't, P., Kamiński, M., & Paulusma, D. (2012). Finding induced paths of given parity in claw-free graphs. Algorithmica, 62(1-2), 537-563. https://doi.org/10.1007/s00453-010-9470-5

The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determ... Read More about Finding induced paths of given parity in claw-free graphs.

Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control (2012)
Journal Article
Chen, N., Yan, Z., Gadouleau, M., Wang, Y., & Suter, B. W. (2012). Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 20(2), 296-309. https://doi.org/10.1109/tvlsi.2010.2096239

While random linear network coding is a powerful tool for disseminating information in communication networks, it is highly susceptible to errors caused by various sources. Due to error propagation, errors greatly deteriorate the throughput of networ... Read More about Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control.

Node-to-node disjoint paths in k-ary n-cubes with faulty edges. (2012)
Presentation / Conference Contribution
Xiang, Y., Stewart, I., & Madelaine, F. (2012, January). Node-to-node disjoint paths in k-ary n-cubes with faulty edges. Presented at 17th International Conference on Parallel and Distributed Systems, ICPADS'11., Tainan, Taiwan

Let u and v be any two given nodes in a k-ary n-cube Qnk with at most 2n-2 faulty edges. Suppose that the number of healthy links incident with u is no more than that of v, and denote this number by m. In this paper, we show that there are m mutually... Read More about Node-to-node disjoint paths in k-ary n-cubes with faulty edges..

Refractive elements for the measurement of the orbital angular momentum of a single photon (2012)
Journal Article
Lavery, M. P., Robertson, D. J., Berkhout, G. C., Love, G. D., Padgett, M. J., & Courtial, J. (2012). Refractive elements for the measurement of the orbital angular momentum of a single photon. Optics Express, 20(3), 2110-2115. https://doi.org/10.1364/oe.20.002110

We have developed a mode transformer comprising two custom refractive optical elements which convert orbital angular momentum states into transverse momentum states. This transformation allows for an efficient measurement of the orbital angular momen... Read More about Refractive elements for the measurement of the orbital angular momentum of a single photon.

Updating the complexity status of coloring graphs without a fixed induced linear forest (2012)
Journal Article
Broersma, H., Golovach, P., Paulusma, D., & Song, J. (2012). Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical Computer Science, 414(1), 9-19. https://doi.org/10.1016/j.tcs.2011.10.005

A graph is H-free if it does not contain an induced subgraph isomorphic to the graph H. The graph Pk denotes a path on k vertices. The ℓ-Coloring problem is the problem to decide whether a graph can be colored with at most ℓ colors such that adjacent... Read More about Updating the complexity status of coloring graphs without a fixed induced linear forest.

Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems (2012)
Journal Article
Bordewich, M., & Semple, C. (2012). Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems. Journal of Mathematical Biology, 64(1), 69-85. https://doi.org/10.1007/s00285-011-0405-9

Arising in the context of biodiversity conservation, the Budgeted Nature Reserve Selection (BNRS) problem is to select, subject to budgetary constraints, a set of regions to conserve so that the phylogenetic diversity (PD) of the set of species conta... Read More about Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems.