Journal: Information Processing Letters

Found 137 papers in total
Hamiltonicity in connected regular graphs
Hamiltonicity in connected regular graphs
2013,
In 1980, Jackson proved that every 2‐connected k ‐regular graph with at...
Another disjoint compression algorithm for odd cycle transversal
Another disjoint compression algorithm for odd cycle transversal
2013,
Given a graph G and an odd cycle transversal T, we describe an elegant...
Algorithmic aspect of stratified domination in graphs
Algorithmic aspect of stratified domination in graphs
2013,
Chartrand, Haynes, Henning and Zhang introduced a variation of domination called...
A note on minimum-sum coverage by aligned disks
A note on minimum-sum coverage by aligned disks
2013,
In this paper, we consider a facility location problem to find a minimum-sum coverage...
Improved neural solution for the Lyapunov matrix equation based on gradient search
Improved neural solution for the Lyapunov matrix equation based on gradient search
2013,
By using the hierarchical identification principle, based on the conventional gradient...
Incremental Beam search
Incremental Beam search
2013,
Beam search is a heuristic search algorithm that explores a state‐space graph...
A faster FPT algorithm for Bipartite Contraction
A faster FPT algorithm for Bipartite Contraction
2013,
The Bipartite Contraction problem is to decide, given a graph G and a parameter k,...
A note on exact distance labeling
A note on exact distance labeling
2011,
• Exact distance‐labels of edge‐weighted undirected graphs. •...
A factor 2 approximation algorithm for the vertex cover P3 problem
A factor 2 approximation algorithm for the vertex cover P3 problem
2011,
• In the article we translate the camera layout problem into the vertex cover P n...
A note on ‘An optimal online algorithm for single machine scheduling to minimize total general completion time’
A note on ‘An optimal online algorithm for single machine scheduling to minimize total general completion time’
2012,
In this paper we study the problem of online scheduling of jobs with release times on...
A note on labeling schemes for graph connectivity
A note on labeling schemes for graph connectivity
2012,
Let G = ( V , E ) be an undirected graph and let S ⊆ V . The S...
A note on the Kenyon‐Remila strip-packing algorithm
A note on the Kenyon‐Remila strip-packing algorithm
2012,
We show that a modification of the Kenyon–Remila algorithm for the...
Physarum can compute shortest paths: A short proof
Physarum can compute shortest paths: A short proof
2013,
The purpose of this note is to give a short proof that a standard model for the...
Counting closed trails
Counting closed trails
2013,
A closed trail is a connected graph whose every vertex is incident to an even number...
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
2013,
This paper provides a proof of NExpTime ‐completeness of the satisfiability...
Model checking conditional CSL for continuous-time Markov chains
Model checking conditional CSL for continuous-time Markov chains
2013,
In this paper, we consider the model‐checking problem of continuous‐time...
Approximating the min‐max (regret) selecting items problem
Approximating the min‐max (regret) selecting items problem
2013,
In this paper the problem of selecting p items out of n available to minimize the...
Dynamics of a mean-shift-like algorithm and its applications on clustering
Dynamics of a mean-shift-like algorithm and its applications on clustering
2013,
The Mean‐Shift (MS) algorithm and its variants have wide applications in...
X‐code double parity array operation with two disk failures
X‐code double parity array operation with two disk failures
2011,
X-code extends parity coding for correcting single disk failures in RAID 5 to two...
On the possible patterns of inputs for block sorting in the Burrows–Wheeler transformation
On the possible patterns of inputs for block sorting in the Burrows–Wheeler transformation
2011,
Block sorting in the Burrows–Wheeler transformation is to sort all of the n circular...
An industrial study on the importance of software component documentation: A system integrator's perspective
An industrial study on the importance of software component documentation: A system integrator's perspective
2011,
Component integration is widely recognized as a process which plays a central role in...
Unbounded parallel‐batch scheduling with family jobs and delivery coordination
Unbounded parallel‐batch scheduling with family jobs and delivery coordination
2011,
We study a scheduling problem that integrates parallel-batch production with family...
Walks in phylogenetic treespace
Walks in phylogenetic treespace
2011,
We prove that the spaces of unrooted phylogenetic trees are Hamiltonian for two...
Shorter strings containing all k‐element permutations
Shorter strings containing all k‐element permutations
2011,
We consider the problem of finding short strings that contain all permutations of...
Papers per page: