A note on fixpoint techniques in data base recursive logic programs
A note on Glushkov's algorithm of the synthesis of finite automata
A note on grammars with regular restrictions
A note on homomorphisms of a free monoid.
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do not overlap, it is also a unit coin graph or penny graph. It is known that finding a maximum independent set in a unit disk graph is a NP-hard problem. In this work we extend this result to penny graphs. Furthermore, we prove that finding a minimum clique partition in a penny graph is also NP-hard, and present two linear-time approximation algorithms for the computation of clique partitions: a 3-approximation...
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do not overlap, it is also a unit coin graph or penny graph. It is known that finding a maximum independent set in a unit disk graph is a NP-hard problem. In this work we extend this result to penny graphs. Furthermore, we prove that finding a minimum clique partition in a penny graph is also NP-hard, and present two linear-time approximation algorithms for the computation of clique partitions: a 3-approximation...
A note on minimum rank and maximum nullity of sign patterns.
A note on minimum-dummy-activities PERT networks
A note on negative tagging for least fixed-point formulae
A Note on Negative Tagging for Least Fixed-Point Formulae
Proof systems with sequents of the form U ⊢ Φ for proving validity of a propositional modal μ-calculus formula Φ over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without...
A note on NSPACE () and substitution
A note on outerplanarity of product graphs
A note on read- times branching programs
A note on rectilinearity and angular resolution.
A note on rewriting theory for uniqueness of iteration.
A note on r-extensible prefix codes.
A note on separating the relativized polynomial time hierarchy by immune sets
A note on the asymptotic and computational complexity of graph distinguishability.
A note on the asymptotic behavior of the heights in -trees for large.
A note on the computational complexity of computing the edge rotation distance between graphs