Results 131 to 140 of about 155 (146)
Some of the next articles are maybe not open access.

Testing k-colorability

SIAM Journal on Discrete Mathematics, 2002
Noga Alon
exaly  

Spectral Sparsification of Graphs

SIAM Journal on Computing, 2011
Daniel Spielman
exaly  

The bicube: an interconnection of two hypercubes

International Journal of Computer Mathematics, 2015
Jung-Heum Park   +2 more
exaly  

Computing the metric dimension of the categorial product of some graphs

International Journal of Computer Mathematics, 2017
Ali Ahmad, Tomáš Vetrík
exaly  

Thek-neighbourhood-covering problem on interval graphs

International Journal of Computer Mathematics, 2010
Sukumar Mondal   +2 more
exaly  

Conditional Hardness for Approximate Coloring

SIAM Journal on Computing, 2009
Elchanan Mossel
exaly  

Graph Sparsification by Effective Resistances

SIAM Journal on Computing, 2011
Daniel Spielman, Nikhil Srivastava
exaly  

A $c^k n$ 5-Approximation Algorithm for Treewidth

SIAM Journal on Computing, 2016
Michał Pilipczuk   +2 more
exaly  

Tight Bounds for Testing Bipartiteness in General Graphs

SIAM Journal on Computing, 2004
Dana Ron, Tali Kaufman
exaly  

The Complexity of Computing the Sign of the Tutte Polynomial

SIAM Journal on Computing, 2014
Mark Jerrum, Leslie Goldberg
exaly  

Home - About - Disclaimer - Privacy