Search Sciweavers | Sciweavers

1729 search results - page 66 / 346

» On Bounds for the k-Partitioning of Graphs

click to vote

ICECCS
1997
IEEE

105views Hardware» more ICECCS 1997»

Feasibility concerns in PGM graphs with bounded buffers

15 years 2 months ago

Download cse.unl.edu

Sanjoy K. Baruah, Steve Goddard, Kevin Jeffay

claim paper

Read More »

click to vote

DAC
1996
ACM

61views Computer Architecture» more DAC 1996»

Lower Bounds on Test Resources for Scheduled Data Flow Graphs

15 years 2 months ago

Download poisson.usc.edu

Ishwar Parulkar, Sandeep K. Gupta, Melvin A. Breue...

claim paper

Read More »

click to vote

STOC
1996
ACM

83views Algorithms» more STOC 1996»

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs

15 years 2 months ago

Download www.inf.ethz.ch

László Babai, Anna Gál, J&aac...

claim paper

Read More »

click to vote

FOCS
1989
IEEE

60views Theoretical Computer Science» more FOCS 1989»

An Optimal Lower Bound on the Number of Variables for Graph Identification

15 years 2 months ago

Download www.cs.umass.edu

Jin-yi Cai, Martin Fürer, Neil Immerman

claim paper

Read More »

click to vote

APPROX
2006
Springer

76views Algorithms» more APPROX 2006»

Distance Approximation in Bounded-Degree and General Sparse Graphs

15 years 1 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers