828 search results - page 5 / 166 » Bounded Hairpin Completion |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
SIAMDM
2010
13 years 2 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
MCSS
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we consider systems which are globally completly observable and output-to-state stable. The former property guarantees the existence of coordinates such that the dyna...
APN
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...