8810 search results - page 1321 / 1762 » Openness |
153
click to vote
DM
2010
15 years 7 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
178
click to vote
ENTCS
2010
15 years 7 months ago
2010
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
128
click to vote
DM
2008
15 years 7 months ago
2008
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
192
click to vote
ECCC
2008
15 years 7 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
176
click to vote
ECCC
2008
15 years 7 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....