1105 search results - page 51 / 221 » Linear choosability of graphs |
CIE
2008
Springer
15 years 1 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
WG
2007
Springer
15 years 6 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
AGP
1999
IEEE
15 years 4 months ago
1999
IEEE
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
CDC
2008
IEEE
15 years 1 months ago
2008
IEEE
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...