SWAT 2004 - PDF Preprint Papers

SWAT 2004 Scandinavian Workshop on Algorithm Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SWAT-2004 Paper

click to vote

SWAT
2004
Springer

171views Algorithms» more SWAT 2004»

Connectivity of Graphs Under Edge Flips

13 years 10 months ago

Download torch.cs.dal.ca

We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we deﬁne a graph family G(V, E) as the set of graphs that have vertex set V and contain ...

Norbert Zeh

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	171	Connectivity of Graphs Under Edge Flips	claim
2	163	New Algorithms for Enumerating All Maximal Cliques	claim
3	156	The Bottleneck Problem with Minimum Quantity Commitments	claim
4	153	Melding Priority Queues	claim
5	146	Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths	claim
6	142	Getting the Best Response for Your Erg	claim
7	138	Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks	claim
8	136	The Relative Worst Order Ratio Applied to Seat Reservation	claim
9	131	Design and Analysis of Dynamic Multithreaded Algorithms	claim
10	129	Collective Tree Spanners of Graphs	claim
11	129	Online Scheduling of Splittable Tasks in Peer-to-Peer Networks	claim
12	125	The Optimal Online Algorithms for Minimizing Maximum Lateness	claim
13	123	A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension	claim
14	120	Railway Delay Management: Exploring Its Algorithmic Complexity	claim
15	120	Matching Polyhedral Terrains Using Overlays of Envelopes	claim
16	117	Maximizing the Number of Packed Rectangles	claim
17	109	Robust Subgraphs for Trees and Paths	claim
18	108	Independent Set of Intersection Graphs of Convex Objects in 2D	claim
19	108	Pointed Binary Encompassing Trees	claim
20	103	Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion	claim
21	98	Tight Approximability Results for Test Set Problems in Bioinformatics	claim
22	95	Cache-Oblivious Algorithms and Data Structures	claim
23	90	Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices	claim
24	85	Simplified External Memory Algorithms for Planar DAGs	claim
25	83	Power Assignment in Radio Networks with Two Power Levels	claim
26	78	Online Maintenance of k-Medians and k-Covers on a Line	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers