Results 1  10
of
50
Arbor
, 2008
"... While botnets themselves provide a rich platform for financial gain for the botnet master, the use of the infected hosts as webservers can provide an additional botnet use. Botnet herders often use fastflux DNS techniques to host unwanted or illegal content within a botnet. These techniques change ..."
Abstract
 Add to MetaCart
the mapping of the domain name to different bots within the botnet with constant shifting, while the bots simply relay content back to a central server. This can give the attackers additional stepping stones to thwart takedown and can obscure their true origins. Evidence suggests that more attackers
Arboricity and Bipartite Subgraph Listing Algorithms
, 1994
"... In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear time algorithm to list such subgraphs. The arboricity bound is necessary: for any constant k and any n there exists an nvertex graph with O(n) edges and (n/ log n) k ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear time algorithm to list such subgraphs. The arboricity bound is necessary: for any constant k and any n there exists an nvertex graph with O(n) edges and (n/ log n) k
Incidence coloring game and arboricity of graphs
, 2013
"... An incidence of a graph G is a pair (v, e) where v is a vertex of G and e an edge incident to v. Two incidences (v, e) and (w, f) are adjacent whenever v = w, or e = f, or vw = e or f. The incidence coloring game [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 198 ..."
Abstract
 Add to MetaCart
∆(G)−a(G)2 c + 8a(G) − 2 for every graph G, where a(G) stands for the arboricity of G, thus improving the bound given by Andres since a(G) ≤ k for every kdegenerate graph G. Since there exists graphs with ig(G) ≥ d 3∆(G)2 e, the multiplicative constant of our bound is best possible.
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
"... Since in general it is NPhard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation algorithms on restricted graph classes. In this paper, we compromise between generality and efficiency by considering the proble ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
factor O(a 2) approximation in randomized time O(log n). This algorithm can be transformed into a deterministic central routine computing a lineartime constant approximation on a graph of bounded arboricity, without a priori knowledge on a. The second algorithm exhibits an approximation ratio of O(a log
Synaptic density in geniculocortical afferents remains constant after monocular deprivation in the cat
 J Neurosci
, 1999
"... Monocular eyelid closure in cats during a critical period in development produces both physiological plasticity, as indicated by a loss of responsiveness of primary visual cortical neurons to deprived eye stimulation, and morphological plasticity, as demonstrated by a decrease in the total length of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
of individual geniculocortical arbors representing the deprived eye. Although the physiological plasticity appears maximal after 2 d of monocular deprivation (MD), the shrinkage of deprivedeye geniculocortical arbors is less than halfmaximal at 4dand is not maximal until 7 d of deprivation, at which time
Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
 In Proc. 20th International Symposium on Algorithms and Computation (ISAAC
, 2009
"... Abstract. We give a deterministic distributed approximation algorithm for the maximum matching problem in graphs of bounded arboricity. Specifically, given 0 < < 1 and a positive integer a, the algorithm finds a matching of size at least (1 − )m(G), where m(G) is the size of the maximum match ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
on the time complexity for a constant or polylogarithmic approximation does not hold for graphs of bounded arboricity.
Ann Arbor, MI 481091220Unequal Treatment of Identical Agents in Cournot Equilibrium: Private and Social Advantages
"... We derive a comparativestatic result for interior Cournot equilibria when rms have constant marginal costs. Our result provides a simple criterion to determine, for any redistribution across the rms of an unchanged marginalcost sum, whether industry industry pro t and social surplus increase. We t ..."
Abstract
 Add to MetaCart
We derive a comparativestatic result for interior Cournot equilibria when rms have constant marginal costs. Our result provides a simple criterion to determine, for any redistribution across the rms of an unchanged marginalcost sum, whether industry industry pro t and social surplus increase. We
Scenic Hudson Arbor Hill Environmental Justice Corp. Clean Ocean Action Hudson River Fishermen's Association, New Jersey Chapter
, 2010
"... Environmental Protection Agency’s (EPA) and General Electric’s (GE) March 2010 Phase 1 Evaluation Reports (the “EPA Report ” and “GE Report, ” respectively), for consideration by the Engineering Performance Standards (EPS) Peer Review Panel. Attached to and referenced throughout this letter is a rev ..."
Abstract
 Add to MetaCart
of Decision (ROD). You will note, therefore, that our comments address the EPS, but with the constant reference to achieving those goals.
Orienting Fully Dynamic Graphs with WorstCase Time Bounds
, 2014
"... In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
on the update time. Low outdegree orientations turned out to be a surprisingly useful tool for managing networks. Brodal and Fagerberg (1999) initiated the study of the edge orientation problem in terms of the graph’s arboricity, which is very natural in this context. Their solution achieves a constant out
Diversity and evolution of macrohabitat use, body size and morphology in a monophyletic group of Neotropical pitvipers (Bothrops
 J. Zool. (Lond
, 2001
"... The Neotropical pitviper genus Bothrops comprises about 40 species, which occur in all main ecosystems of cisAndean South America. We explored the relationships of body size and form (tail length and stoutness) with macrohabitat use in 20 forms of Bothrops. Semiarboreal habits appeared only in for ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(positively) and stoutness (negatively); thus, the more arboreal the species, the longer its tail and the more slender its body. Contrasts of adult body size seems to remain constant over the lower range of macrohabitat use, but to decrease in species of Bothrops which are more arboreal. Reconstructions
Results 1  10
of
50