<we><edit> <!-- questions and answers -->
physics
complexity-classes
parameterized-complexity
type-systems
p-vs-np
pr.probability
advice-request
type-theory
kolmogorov-complexity
gr.group-theory
application-of-theory
approximation-algorithms
integer-programming
big-list
set-cover
polynomials
lo.logic
tree
optimization
planar-graphs
clique
circuit-complexity
communication-complexity
ai.artificial-intel
co.combinatorics
graph-algorithms
How to solve the Shortest Hamiltonian Path problem on Sparse Graphs?
graph-algorithms
co.combinatorics
shortest-path
Minimal Cost of Eulerian Path
ds.algorithms
graph-theory
graph-algorithms
optimization
Counting the number of connected components in a dynamic plane graph
graph-theory
graph-algorithms
planar-graphs
Why isn't the Charikar algorithm for finding the densest subgraph optimal?
graph-theory
graph-algorithms
approximation
Unbalanced connected partition
graph-theory
graph-algorithms
approximation-algorithms
partition-problem
What are graph grammars?
graph-theory
graph-algorithms
fl.formal-languages
grammars
Number of maximally different DAG's in a digraph?
ds.algorithms
graph-algorithms
Vertex deletion to perfect matching
ds.algorithms
graph-theory
graph-algorithms
fixed-parameter-tractable
How to design an algorithm which turns an undirected graph into directed with all nodes of indegree higher than 0?
graph-algorithms
directed-acyclic-graph
topology
Are query-dependent ranking algortihms for web search doomed to be impractical?
graph-algorithms
What are some techniques for "balancing" a tree beside heavy-light and centroid decomposition?
ds.algorithms
graph-algorithms
tree
dynamic-algorithms
Complexity of finding semi-ordered Eulerian tours in a 4-regular graph
graph-theory
graph-algorithms
time-complexity
Cluster Assignment in the Stochastic Block Model
graph-algorithms
lg.learning
randomness
One Generalization of Graph Isomorphism Problem
graph-theory
graph-algorithms
graph-isomorphism
Determining ties in random network centrality rankings?
graph-theory
graph-algorithms
\alpha-path on Euclidean graphs
ds.algorithms
graph-algorithms
approximation-algorithms
ds.data-structures
lower-bounds
Algorithm finding path with maximal ratio of white vertices
graph-theory
graph-algorithms
Decomposition of edges of eulerian graph into maximum number of cycles
graph-theory
graph-algorithms
Algorithm for computing unordered tree edit distance
graph-algorithms
tree
edit-distance
Optimizing Maximum Weighted Matching (Edmonds Blossom)
ds.algorithms
graph-theory
graph-algorithms
optimization
matching
Complexity consequence of logarithmic boolean width of co-bounded degree graphs?
cc.complexity-theory
graph-theory
graph-algorithms
Transitive Closure of Weighted Random Graphs?
graph-theory
graph-algorithms
transitive-closure
Finding k shortest Paths with Eppstein's Algorithm
ds.algorithms
graph-theory
graph-algorithms
directed-acyclic-graph
Modifying Edmonds' Blossom Algorithm
ds.algorithms
graph-theory
graph-algorithms
optimization
Clique cover problem
graph-theory
graph-algorithms
np-hardness
approximation-algorithms
Max weight travel on a graph with deadline
graph-algorithms
np-hardness
linear-programming
integer-programming
dynamic-programming
Graph factors of maximum weight
ds.algorithms
graph-theory
graph-algorithms
matching
Max-weight connected & co-connected subgraph problem
ds.algorithms
graph-algorithms
np-hardness
What is known about learning a maximal independent set in a (very) sparse graph?
ds.algorithms
graph-algorithms
lg.learning
query-complexity
Efficiently computing the union of all minimal unsatisfiable constraint sets in a first-order unification problem
ds.algorithms
graph-algorithms
lo.logic
Does a weighted graph have a path with weight zero?
graph-algorithms
np-hardness
Hard problems for bounded vertex cover
graph-algorithms
graph-colouring
parameterized-complexity
fixed-parameter-tractable
Approximating the Radius of a (Dense) Graph
graph-algorithms
approximation-algorithms
approximation-hardness
approximation
fine-grained
A conceptual question regarding hardness proofs by reduction
graph-theory
graph-algorithms
np-hardness
reductions
complexity-theory
Complexity status of restricted k-clique
ds.algorithms
graph-algorithms
time-complexity
space-complexity
logspace
Fastest way to find an s-t min-cut from an s-t max-flow?
graph-algorithms
max-flow
max-flow-min-cut
Solving a "tree-equation"?
graph-algorithms
term-rewriting-systems
Restricted k-set cover is in NL or L
cc.complexity-theory
ds.algorithms
graph-algorithms
logspace
Efficient update of reachable set of a node in a digraph
ds.algorithms
graph-theory
graph-algorithms
How to partition a graph while minimizing the count of intra-edges?
graph-theory
graph-algorithms
approximation-algorithms
graph-colouring
partition-problem
k-Vertex Cover problem is in NC_1 or AC_0
cc.complexity-theory
graph-algorithms
circuit-complexity
space-complexity
logspace
Vertex Cover applications in the real world
ds.algorithms
graph-theory
graph-algorithms
Log space algorithms for modular decomposition tree
cc.complexity-theory
ds.algorithms
reference-request
graph-theory
graph-algorithms
Reachability in Dynamic Line Graph
ds.algorithms
graph-theory
graph-algorithms
ds.data-structures
What is the computational complexity of "solving" chess?
cc.complexity-theory
graph-algorithms
board-games
Maximal non-reducible vertex cover of a graph
graph-theory
graph-algorithms
time-complexity
parametrized logspace algorithm for k-dominating set for planar graphs
cc.complexity-theory
graph-algorithms
space-complexity
logspace
Can Lexicographic BFS be implemented in logspace?
cc.complexity-theory
graph-theory
graph-algorithms
logspace
How to check whether graph of n vertex contains n/k disjoint k - complete graph by linear programming?
graph-theory
graph-algorithms
linear-programming
2FA state complexity of k-Clique?
cc.complexity-theory
ds.algorithms
graph-algorithms
clique
Paper regarding the complexity of the longest path problem on weighted directed graphs of bounded treewidth
cc.complexity-theory
graph-algorithms
treewidth
fixed-parameter-tractable
dynamic-programming
Deterministic Parallel algorithm for perfect matching in general graphs?
cc.complexity-theory
ds.algorithms
reference-request
graph-algorithms
dc.parallel-comp
Algorithms for finding all cliques of a given degree in a graph
graph-algorithms
clique
Optimal polynomial time algorithm to determine if a random graph is $k$-colorable
cc.complexity-theory
graph-theory
graph-algorithms
average-case-complexity
Add a matching to a Hamiltonian path to reduce the max distance between given pairs of vertices
cc.complexity-theory
graph-theory
graph-algorithms
np-hardness
np-complete
Is there a better than brute-force solution to the shortest simple path problem?
graph-algorithms
upper-bounds
Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs
graph-algorithms
np-hardness
treewidth
parameterized-complexity
fixed-parameter-tractable
Fastest known deterministic algorithm for the undirected Graph Isomorphism problem
cc.complexity-theory
reference-request
graph-algorithms
graph-isomorphism
Embedding a graph with specified edge lengths in d-dimensional space
graph-theory
graph-algorithms
embeddings
Looking for a list of algorithms that are more efficient for an outerplanar graph than for an arbitrary graph
graph-theory
graph-algorithms
Finding almost minimum cycle
graph-algorithms
Computing mTSP in a k-complete weighted graph
graph-theory
graph-algorithms
tsp
What can i learn about a graph about which only certain properties are known
graph-theory
graph-algorithms
planar-graphs
Combinatorial Independent set Algorithms for sub-classes of perfect graphs
ds.algorithms
graph-theory
graph-algorithms
Complexity of counting the number of edge covers of a graph
reference-request
graph-algorithms
counting-complexity
proofs
Hardness of Subgraph isomorphism problem for sparse pattern graph
ds.algorithms
graph-algorithms
lower-bounds
parameterized-complexity
fine-grained
Efficient enumeration of the reachable leaves of nodes in a polytree
ds.algorithms
graph-algorithms
tree
transitive-closure
Computational Complexity of cycle double cover
cc.complexity-theory
graph-theory
graph-algorithms
np-hardness
quantum-computing
Finding minimum weight $k$ cliques in a complete graph
graph-algorithms
approximation-algorithms
clique
find the densest subgraph of size k
graph-theory
graph-algorithms
Examples of "Sandpile" TSP Instances
graph-algorithms
np-hardness
zero-sum path problem on a digraph
graph-theory
graph-algorithms
Reachability on DAG (best-known algorithm)
cc.complexity-theory
graph-algorithms
ds.data-structures
Average of a variable over point pairs within a given distance in a point set in Cartesian space
graph-theory
graph-algorithms
fourier-analysis
questions on implications Babais quasi P time graph isomorphism result
graph-theory
graph-algorithms
time-complexity
graph-isomorphism
polynomial-time
Generalizing linear interpolation to posets
ds.algorithms
reference-request
graph-algorithms
partial-order
Online triangle counting
ds.algorithms
graph-algorithms
ds.data-structures
online-algorithms
fine-grained
Approaches for Theoretical Analysis of Estimates of Probability Distributions
reference-request
graph-algorithms
approximation-algorithms
pr.probability
Bounded 0/1-knapsack with dependency constraints without limit
graph-algorithms
Partition refinement in transition state systems (bisimulation contraction)
graph-theory
graph-algorithms
automata-theory
partition-problem
A linear time algorithm for the all pair longest paths on a special kind of trees
ds.algorithms
graph-theory
graph-algorithms
dynamic-programming
Finding a graph that minimizes the number of nodes for a given number of paths
graph-theory
graph-algorithms
Nonstandard dual parametrization of graph problems
reference-request
graph-algorithms
fixed-parameter-tractable
Shortest cycle separator for biconnected planar graphs
reference-request
graph-theory
graph-algorithms
planar-graphs
Number of bounded minimum vertex covers
cc.complexity-theory
graph-theory
graph-algorithms
Random walk and mean hitting time in a simple undirected graph
graph-theory
graph-algorithms
co.combinatorics
random-walks
analysis-of-algorithms
Max weight k-clique
graph-theory
graph-algorithms
clique
Min cost set of edges to connect 2 subgraphs s.t dist of nodes between subgraphs <= K
graph-theory
graph-algorithms
optimization
linear-programming
integer-programming
Shortest distance problem with length as functions of time
graph-algorithms
shortest-path
Program for computing Tree decomposition of a graph
ds.algorithms
graph-theory
graph-algorithms
software
treewidth
Travelling Salesman Problem where a subset of the nodes must be visited in a particular order
graph-algorithms
tsp
Bidirectional A*: is an update of the distance estimation feasible while searching?
graph-theory
graph-algorithms
Triangle arrangement problem
graph-theory
graph-algorithms
np-hardness
cg.comp-geom
Graph Isomorphism Algorithm of Vertex Transistive Graphs and other
graph-theory
graph-algorithms
reductions
graph-isomorphism
Dichotomy of the spectra of directed graphs
graph-theory
graph-algorithms
linear-algebra
spectral-graph-theory
Deciding $\omega(G)>k$ when $\alpha(G)$ and $\chi(G)$ have bounds and are known
graph-algorithms
np-complete
graph-colouring
clique
independent-set
Longest path from every vertex in a tournament
graph-theory
graph-algorithms
Number of reachable vertices in DAG for every vertex
ds.algorithms
graph-theory
graph-algorithms
directed-acyclic-graph
Fastest Algorithm for the Minimum Edge Covering Problem
graph-theory
graph-algorithms
optimization
time-complexity
What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?
ds.algorithms
co.combinatorics
graph-algorithms
heuristics
matching