Yazar

Samir Khuller

20 cilt bulundu.

Cilt sonuçları

Approximation Algorithms for Combinatorial Optimization

Klaus Jansen, Samir Khuller · Springer

296 sayfa · 2000-08-25

Computers

Fault-tolerant computingFault Tolerant K-center ProblemsSamir Khuller, Robert Pless, Yoram J. Sussmann

Fault Tolerant K-center Problems

Samir Khuller, Robert Pless, Yoram J. Sussmann · Yayınevi bilinmiyor

13 sayfa · 1996

Fault-tolerant computing

Computer graphicsGraphbotsSamir Khuller, Ehud Rivlin, Azriel Rosenfeld

Graphbots

Samir Khuller, Ehud Rivlin, Azriel Rosenfeld · Yayınevi bilinmiyor

18 sayfa · 1994

Computer graphics

CiltParallel Algorithms for K5-monir Free GraphsSamir Khuller

Parallel Algorithms for K5-monir Free Graphs

Samir Khuller · Yayınevi bilinmiyor

15 sayfa · 1988

Kategori yok

AlgorithmsParallel Algorithms for K[subscript 5]-minor Free GraphsCornell University. Dept. of Computer Science, S. Khuller

Parallel Algorithms for K[subscript 5]-minor Free Graphs

Cornell University. Dept. of Computer Science, S. Khuller · Yayınevi bilinmiyor

15 sayfa · 1988

Algorithms

AlgorithmsProcessor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski HomeomorphCornell University. Dept. of Computer Science, S. Khuller, S. G. Mitchell, V. V. Vazirani

Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph

Cornell University. Dept. of Computer Science, S. Khuller, S. G. Mitchell, V. V. Vazirani · Yayınevi bilinmiyor

29 sayfa · 1989

Algorithms

AlgorithmsOn Computing Graph ClosuresCornell University. Department of Computer Science, S. Khuller

On Computing Graph Closures

Cornell University. Department of Computer Science, S. Khuller · Yayınevi bilinmiyor

15 sayfa · 1988

Algorithms

AlgorithmsEfficient Parallel Algorithms for Testing K-connectivity and Finding Disjoint S-t Paths in GraphsCornell University. Dept. of Computer Science, S. Khuller, B. Schieber

Efficient Parallel Algorithms for Testing K-connectivity and Finding Disjoint S-t Paths in Graphs

Cornell University. Dept. of Computer Science, S. Khuller, B. Schieber · Yayınevi bilinmiyor

33 sayfa · 1990

Algorithms

Graph theoryParallel Algorithms for the Subgraph Homeomorphism ProblemCornell University. Dept. of Computer Science, S. Khuller

Parallel Algorithms for the Subgraph Homeomorphism Problem

Cornell University. Dept. of Computer Science, S. Khuller · Yayınevi bilinmiyor

16 sayfa · 1989

Graph theory

Paths and cycles (Graph theory)Balancing Minimum Spanning and Shortest Path TreesSamir Khuller, Balaji Raghavachari, Neal Young

Balancing Minimum Spanning and Shortest Path Trees

Samir Khuller, Balaji Raghavachari, Neal Young · Yayınevi bilinmiyor

10 sayfa · 1992

Paths and cycles (Graph theory)

AlgorithmsOn-line Algorithms for Weighted Matching and Stable MarriagesCornell University. Dept. of Computer Science, S. Khuller, S. G. Mitchell, V. V. Vazirani

On-line Algorithms for Weighted Matching and Stable Marriages

Cornell University. Dept. of Computer Science, S. Khuller, S. G. Mitchell, V. V. Vazirani · Yayınevi bilinmiyor

10 sayfa · 1990

Algorithms

CiltFlow in Planar GraphsSamir Khuller, Joseph Naor

Flow in Planar Graphs

Samir Khuller, Joseph Naor · Yayınevi bilinmiyor

46 sayfa · 1992

Kategori yok

Mathematical optimizationOptimal Enclosure ProblemsCornell University. Dept. of Computer Science, E. M. Arkin, S. Khuller, J. S. B. Mitchell

Optimal Enclosure Problems

Cornell University. Dept. of Computer Science, E. M. Arkin, S. Khuller, J. S. B. Mitchell · Yayınevi bilinmiyor

26 sayfa · 1990

Mathematical optimization

AlgorithmsEfficient Parallel Algorithms for Disjoint Paths and ConnectivityCornell University. Dept. of Computer Science, S. Khuller

Efficient Parallel Algorithms for Disjoint Paths and Connectivity

Cornell University. Dept. of Computer Science, S. Khuller · Yayınevi bilinmiyor

68 sayfa · 1990

Algorithms

AlgorithmsExtending Planar Graph Algorithms to K[subscript (3,3)]-free GraphsCornell University. Dept. of Computer Science, S. Khuller

Extending Planar Graph Algorithms to K[subscript (3,3)]-free Graphs

Cornell University. Dept. of Computer Science, S. Khuller · Yayınevi bilinmiyor

14 sayfa · 1988

Algorithms

CiltOn-line Algorithms for Weighted Matching and Stables MarriagesSamir Khuller, Stephen G. Mitchell, Vijay V. Vazirani

On-line Algorithms for Weighted Matching and Stables Marriages

Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani · Yayınevi bilinmiyor

10 sayfa · 1990

Kategori yok

CiltNC Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski HomeomorphSamir Khuller, Stephen Mitchell, Vijay V. Vazirani

NC Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph

Samir Khuller, Stephen Mitchell, Vijay V. Vazirani · Yayınevi bilinmiyor

25 sayfa · 1988

Kategori yok

Computer scienceProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingSamir Khuller

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

Samir Khuller · Yayınevi bilinmiyor

1797 sayfa · 2021

Computer science

CiltPlanar Graph Coloring is Not Self-reducible Assuming P Not Equal to NP.Cornell University. Department of Computer Science, S. Shuller, V. V. Vazirani

Planar Graph Coloring is Not Self-reducible Assuming P Not Equal to NP.

Cornell University. Department of Computer Science, S. Shuller, V. V. Vazirani · Yayınevi bilinmiyor

7 sayfa · 1989

Kategori yok

AlgorithmsApproximation Algorithms for Finding Highly Connected SubgraphsSamir Khuller

Approximation Algorithms for Finding Highly Connected Subgraphs

Samir Khuller · Yayınevi bilinmiyor

32 sayfa · 1995

Algorithms