Skip to main content

Research Repository

Advanced Search

Outputs (3178)

Parameterizing cut sets in a graph by the number of their components (2009)
Presentation / Conference Contribution
Ito, T., Kaminski, M., Paulusma, D., & Thilikos, D. M. (2009, December). Parameterizing cut sets in a graph by the number of their components. Presented at 20th International Symposium on Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, United States

For a connected graph G = (V,E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k ( ≥ 1) components. More specifically, a k-cut U is called a (k,ℓ)-cut if V \U induces a subgraph with exactly ℓ ( ≥... Read More about Parameterizing cut sets in a graph by the number of their components.

Advances of Soft Computing Methods in Edge Detection (2009)
Journal Article
Atapour-Abarghouei, A., Ghanizadeh, A., & Shamsuddin, S. M. (2009). Advances of Soft Computing Methods in Edge Detection. International journal of advances in soft computing and its applications, 1(2), 162-203

Artificial Intelligence (AI) techniques are now commonly used to solve complex and ill-defined problems. AI a broad field and will bring different meanings for different people. John McCarthy would probably use AI as “computational intelligence”, whi... Read More about Advances of Soft Computing Methods in Edge Detection.

QoS Analysis Models for Wireless Networks (2009)
Presentation / Conference Contribution
Liao, R., Tu, W., Grout, V., & Excel, P. (2009, November). QoS Analysis Models for Wireless Networks. Presented at The Collaborative Research Symposium on Security, E-Learning, Internet and Networking SEIN, Plymouth, UK

Guaranteeing of QoS over wireless networks is a very challenging task. The first and critical step in addressing
this problem is to build up a QoS analysis model which accurately characterizes the fading channel and timevarying capacity of the link,... Read More about QoS Analysis Models for Wireless Networks.

Spontaneous symmetry breaking and circulation by optically bound microparticle chains in Gaussian beam traps (2009)
Journal Article
Taylor, J., & Love, G. (2009). Spontaneous symmetry breaking and circulation by optically bound microparticle chains in Gaussian beam traps. Physical Review A, 80(5), Article 053808. https://doi.org/10.1103/physreva.80.053808

It has been known for some time that simple “optically bound” chains of dielectric microparticles can form in a counter propagating Gaussian beam optical trap. Here we report experimental observations of more complex trapped states, which do not refl... Read More about Spontaneous symmetry breaking and circulation by optically bound microparticle chains in Gaussian beam traps.

On the power of deep pushdown stacks (2009)
Journal Article
Arratia-Quesada, A., & Stewart, I. (2009). On the power of deep pushdown stacks. Acta Informatica, 46(7), 509-531. https://doi.org/10.1007/s00236-009-0103-x

Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, NPSDSs, based around assignments, while-loops and non-deterministic guessing but with access to a deep pushdown stac... Read More about On the power of deep pushdown stacks.

Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs (2009)
Journal Article
Broersma, H., Paulusma, D., & Yoshimoto, K. (2009). Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs. Graphs and Combinatorics, 25(4), 427-460. https://doi.org/10.1007/s00373-009-0855-7

Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. and Gould & Jacobson, and solve two open problems by proving the following two results. If δ = 4, then G has a 2-factor with at most (5n − 14)/18 compo... Read More about Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs.

A biosegmentation benchmark for evaluation of bioimage analysis methods (2009)
Journal Article
Drelie Gelasca, E., Obara, B., Fedorov, D., Kvilekval, K., & Manjunath, B. (2009). A biosegmentation benchmark for evaluation of bioimage analysis methods. BMC Bioinformatics, 10, Article 368. https://doi.org/10.1186/1471-2105-10-368

Background: We present a biosegmentation benchmark that includes infrastructure, datasets with associated ground truth, and validation methods for biological image analysis. The primary motivation for creating this resource comes from the fact that i... Read More about A biosegmentation benchmark for evaluation of bioimage analysis methods.

Three complexity results on coloring Pk-free graphs (2009)
Presentation / Conference Contribution
Broersma, H. J., Fomin, F. V., Golovach, P. A., & Paulusma, D. (2023, June). Three complexity results on coloring Pk-free graphs. Presented at 20th International Workshop on Combinatorial Algorithms (IWOCA 2009), Hradec nad Moravicí, Czech Republic

We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring rema... Read More about Three complexity results on coloring Pk-free graphs.

Pancyclicity in faulty k-ary 2-cubes (2009)
Presentation / Conference Contribution
Xiang, Y., & Stewart, I. (2009, November). Pancyclicity in faulty k-ary 2-cubes. Presented at Proceedings of 21st International Conference on Parallel and Distributed Computing and Systems, PDCS'09., Cambridge, Massachusetts, USA

We prove that a k-ary 2-cube $Q_k^2$ with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k ≥ 3, and k-pancyclic, if k ≥ 5 is odd (these results are optimal).