CPC 2007 - PDF Preprint Papers

CPC 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CPC-2007 Paper

click to vote

CPC
2007

125views more CPC 2007»

Adversarial Deletion in a Scale-Free Random Graph Process

14 years 21 days ago

Download www.math.cmu.edu

We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...

Abraham D. Flaxman, Alan M. Frieze, Juan Vera

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	125	Adversarial Deletion in a Scale-Free Random Graph Process	claim
2	113	Regular Partitions of Hypergraphs: Regularity Lemmas	claim
3	112	Graphs with Large Girth Not Embeddable in the Sphere	claim
4	105	Packing Cliques in Graphs with Independence Number 2	claim
5	101	Colouring Random 4-Regular Graphs	claim
6	97	On an Online Spanning Tree Problem in Randomly Weighted Graphs	claim
7	95	Colouring Random Regular Graphs	claim
8	93	On a Random Graph Related to Quantum Theory	claim
9	91	Additive and Multiplicative Structure in Matrix Spaces	claim
10	90	Regular Partitions of Hypergraphs: Counting Lemmas	claim
11	88	Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs	claim
12	79	Completing a (k - 1)-Assignment	claim
13	77	All Maximum Size Two-Part Sperner Systems: In Short	claim
14	76	Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem	claim
15	76	A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution	claim
16	72	The Angel of Power 2 Wins	claim
17	72	Thresholds and Expectation Thresholds	claim
18	70	The Complexity of Ferromagnetic Ising with Local Fields	claim
19	68	The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments	claim
20	64	Sampling Regular Graphs and a Peer-to-Peer Network	claim
21	61	Maximizing Several Cuts Simultaneously	claim
22	58	Teasing Apart Two Trees	claim
23	55	Limit Law of the Length of the Standard Right Factor of a Lyndon Word	claim
24	50	Ore-type graph packing problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers