Search Sciweavers | Sciweavers

2446 search results - page 67 / 490

» Choiceless Polynomial Time

click to vote

JAL
2006

52views more JAL 2006»

Polynomial time recognition of unit circular-arc graphs

13 years 7 months ago

Download www.cs.colostate.edu

Guillermo Durán, Agustín Gravano, Ro...

claim paper

Read More »

click to vote

MOR
2006

92views more MOR 2006»

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

13 years 7 months ago

Download www.cs.dartmouth.edu

The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...

Lisa Fleischer, Adam N. Letchford, Andrea Lodi

claim paper

Read More »

click to vote

MSCS
2006

49views more MSCS 2006»

On light logics, uniform encodings and polynomial time

13 years 7 months ago

Download www-lipn.univ-paris13.fr

Ugo Dal Lago, Patrick Baillot

claim paper

Read More »

click to vote

CORR
2002
Springer

144views Education» more CORR 2002»

Polynomial Time Data Reduction for Dominating Set

13 years 7 months ago

Download mrfellows.net

Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...

Jochen Alber, Michael R. Fellows, Rolf Niedermeier

claim paper

Read More »

click to vote

JAL
2000

63views more JAL 2000»

Polynomial-Time Analysis of Toroidal Periodic Graphs

13 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers