论文列表及评分结果

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.

电商所评分:5

点击查看评分详情!

On the Complexity of Recognizing Wheeler Graphs.

电商所评分:6

点击查看评分详情!

Linear-Time Recognition of Double-Threshold Graphs.

电商所评分:4

点击查看评分详情!

An Axiomatic Approach to Time-Dependent Shortest Path Oracles.

电商所评分:2

点击查看评分详情!

A Refined Branching Algorithm for the Maximum Satisfiability Problem.

电商所评分:6

点击查看评分详情!

Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms.

电商所评分:5

点击查看评分详情!

Efficient Exact Evaluation of Signs of Determinants.

电商所评分:7

点击查看评分详情!

Shortest Path Geometric Rounding.

电商所评分:1

点击查看评分详情!

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.

电商所评分:1

点击查看评分详情!

Parameterization in Finite Precision.

电商所评分:2

点击查看评分详情!

Erratum: A Correction to "Parallel Approximation Algorithms by Positive Linear Programming".

电商所评分:7

点击查看评分详情!

An Algorithm for Enumerating All Spanning Trees of a Directed Graph.

电商所评分:10

点击查看评分详情!

One for the Price of Two: a Unified Approach for Approximating Covering Problems.

电商所评分:8

点击查看评分详情!

Binary Searching with Nonuniform Costs and Its Application to Text Retrieval.

电商所评分:7

点击查看评分详情!

Smallest Enclosing Cylinders.

电商所评分:3

点击查看评分详情!

Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.

电商所评分:3

点击查看评分详情!

Approximation Algorithms for Minimum K-Cut.

电商所评分:7

点击查看评分详情!

Online Randomized Multiprocessor Scheduling.

电商所评分:4

点击查看评分详情!

Introduction.

电商所评分:8

点击查看评分详情!

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms.

电商所评分:6

点击查看评分详情!

A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees.

电商所评分:8

点击查看评分详情!

Generalized Dominators for Structured Programs.

电商所评分:9

点击查看评分详情!

Linear-Time Algorithms for Partial k-Tree Complements.

电商所评分:2

点击查看评分详情!

Diameter and Treewidth in Minor-Closed Graph Families.

电商所评分:2

点击查看评分详情!

Dynamic Algorithms for Graphs of Bounded Treewidth.

电商所评分:5

点击查看评分详情!

Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs.

电商所评分:7

点击查看评分详情!

Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.

电商所评分:9

点击查看评分详情!

Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees.

电商所评分:3

点击查看评分详情!

Memory Requirements for Table Computations in Partial k-Tree Algorithms.

电商所评分:9

点击查看评分详情!

Graph Searching on Some Subclasses of Chordal Graphs.

电商所评分:3

点击查看评分详情!