NETWORKS 2008 - PDF Preprint Papers

NETWORKS 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NETWORKS-2008 Paper

click to vote

NETWORKS
2008

316views Computer Networks» more NETWORKS 2008»

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

13 years 5 months ago

Download pluto.mscc.huji.ac.il

Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...

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	316	The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases	claim
2	261	The computational complexity of graph contractions II: Two tough polynomially solvable cases	claim
3	223	New dynamic programming algorithms for the resource constrained elementary shortest path problem	claim
4	208	Competitive algorithms and lower bounds for online randomized call control in cellular networks	claim
5	146	Lower bounds for two-period grooming via linear programming duality	claim
6	142	Approximation bounds for Black Hole Search problems	claim
7	132	Price competition with elastic traffic	claim
8	131	Lagrangian relaxation and enumeration for solving constrained shortest-path problems	claim
9	130	A linear programming approach to increasing the weight of all minimum spanning trees	claim
10	129	Grooming for two-period optical networks	claim
11	127	Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs	claim
12	126	Reformulation and sampling to solve a stochastic network interdiction problem	claim
13	120	Decontamination of hypercubes by mobile agents	claim
14	118	On a graph coloring problem arising from discrete tomography	claim
15	115	A simple method for improving the primal simplex method for the multicommodity flow problem	claim
16	115	Spectral bounds for the maximum cut problem	claim
17	108	F-Chord: Improved uniform routing on Chord	claim
18	104	Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships	claim
19	88	New facets for the planar subgraph polytope	claim
20	88	Transversals of subtree hypergraphs and the source location problem in digraphs	claim
21	86	A Reach and Bound algorithm for acyclic dynamic-programming networks	claim
22	83	The number of spanning trees in a class of double fixed-step loop networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers