684 search results - page 49 / 137 » A characterization of b-perfect graphs |
320
click to vote
DNA
2011
Springer
14 years 6 months ago
2011
Springer
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
155
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
197
click to vote
TIT
2010
15 years 26 days ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
176
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
165
click to vote
WG
1994
Springer
15 years 10 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...