<we><edit> <!-- questions and answers -->
quantum-computing
type-theory
time-complexity
sorting
context-free
big-list
directed-acyclic-graph
counting-complexity
upper-bounds
polynomials
reductions
soft-question
boolean-functions
set-cover
grammars
pl.programming-languages
coding-theory
ai.artificial-intel
algebra
np-complete
proof-complexity
graph-theory
convex-optimization
conditional-results
ds.algorithms
graph-theory
PTIME or NP-Hardness of stochastic objective function
cc.complexity-theory
graph-theory
np-hardness
Showing hardness of maximizing stochastic objective function over graph
cc.complexity-theory
graph-theory
np-hardness
optimization
A data structure to answer closest node queries in a weighted tree positively weighted tree
graph-theory
graph-algorithms
ds.data-structures
tree
Results/concepts that also proved useful outside of their "home areas"
cc.complexity-theory
reference-request
graph-theory
combinatorics
Is perfect matching for bipartite graph with no cycles unique?
graph-theory
graph-algorithms
co.combinatorics
matching
bipartite-graphs
Generating random labelled trees
graph-theory
randomized-algorithms
tree
Is NP-complete the existence of paths of a given length in a directed graph?
graph-theory
np-hardness
Closeness Centrality for Weighted Graphs
graph-theory
graph-algorithms
Complexity of Dijkstra algorithm in graph with negative weights
graph-theory
graph-algorithms
time-complexity
shortest-path
Path Finding: single-source, multi-path, multi-target, and max-depth - approaches and application
graph-theory
graph-algorithms
shortest-path
Number of distinct nodes in a random walk
graph-theory
co.combinatorics
random-walks
pr.probability
Realization of a bipolar orientation by a mixed graph
graph-theory
graph-algorithms
directed-acyclic-graph
Complexity of bounded degree full contraction
cc.complexity-theory
graph-theory
graph-algorithms
np-hardness
graph-minor
Finding a Minimal k-Subgraph
graph-theory
matrices
Is there any better than (2/k)-approximation algorithm for Independent Set in Coloring graph?
graph-theory
approximation-algorithms
approximation-hardness
Maintain a given maximum independent set after vertex removal, polynomial?
graph-theory
independent-set
What is the name of a graph with local clustering coefficients equal to zero?
graph-theory
Hardness of Approximation for minimum path cover in an undirected graph?
cc.complexity-theory
graph-theory
approximation-algorithms
approximation-hardness
Counting Isomorphism Types of Graphs
cc.complexity-theory
graph-theory
graph-algorithms
counting-complexity
graph-isomorphism
How good of an approximate 2-coloring can you get of the halved cube graph?
graph-theory
boolean-functions
graph-colouring
approximation
Find the maximum induced (weighted) subgraph with edge weights greater than some minimum
graph-theory
graph-algorithms
optimization
csp
Are social networks typically good expanders?
graph-theory
application-of-theory
expanders
Common insights into hypothetical complexity of graph problems
cc.complexity-theory
graph-theory
np-hardness
What is the complexity of this graph problem?
graph-theory
graph-algorithms
np-hardness
Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second Order Logic?
graph-theory
lo.logic
finite-model-theory
Partitions of regular graphs with upper bounds on bipartition width
graph-theory
graph-algorithms
spectral-graph-theory
upper-bounds
partition-problem
Eigenvalues of adjacency matrix of a connected bipartite graph
graph-theory
spectral-graph-theory
bipartite-graphs
Does any DAG can be topologically sorted?
graph-theory
sorting
topological-graph-theory
Natural (well studied) classes of graphs with treewidth $\Theta(n^\alpha)$ with $1/2 < \alpha < 1$
graph-theory
treewidth
Minimal Cost of Eulerian Path
ds.algorithms
graph-theory
graph-algorithms
optimization
Reduce $m$-clause 3SAT to PLANAR-3SAT in $O(m^{2-\varepsilon})$
cc.complexity-theory
graph-theory
reductions
polynomial-time
boolean-formulas
Maximize graph with k cut edge operations
graph-theory
graph-algorithms
np-complete
Are there any 'graphical' algebras that can describe the 'shape' of graphs?
graph-theory
co.combinatorics
algebra
Efficient way to generate random planar cubic bipartite graphs
cc.complexity-theory
graph-theory
graph-algorithms
planar-graphs
bipartite-graphs
Practical polynomial-time implementation of bounded degree graph isomorphishm
reference-request
graph-theory
graph-isomorphism
implementation
reference for a special modular decomposition
graph-theory
Digraph game reduction problem
graph-theory
sat
reductions
polynomials
two-player-games
Minimum-weight feedback edge set in undirected graph - how to find it? Is it NP hard problem?
graph-theory
graph-algorithms
np-hardness
Will core decomposition get a maximal clique?
graph-theory
clique
Complexity of recognizing generalized graph join
graph-theory
graph-algorithms
cc-complexity-theory
Is DAG isomorphism NP-C
cc.complexity-theory
graph-theory
graph-isomorphism
Are equally weighted MSTs closely related?
graph-theory
spanning-tree
size of the induced matching
graph-theory
matching
Space efficient "industrial" unbalanced expanders
graph-theory
derandomization
expanders
Maximum weight non-overlapping paths in a DAG
graph-theory
max-flow-min-cut
Minimum cut on a directed graph with negative term
graph-theory
max-flow-min-cut
Why do spectral ultrasparsifiers need to be trees
graph-theory
linear-algebra
spectral-graph-theory
linear-equations
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
Is a k-connected graph also k-1 connected?
graph-theory
Bounding size of separators when in-degree/out-degree is small?
graph-theory
directed-acyclic-graph
treewidth
Data structure to search name of files and get its path
graph-theory
optimization
ds.data-structures
FOL sentence encoding acyclic graphs using only universal quantifiers
graph-theory
lo.logic
directed-acyclic-graph
first-order-logic
Random Deterministic Automata
graph-theory
automata-theory
pr.probability
Flow Optimization: minimum cost matching of demands from multiple sinks
graph-theory
optimization
max-flow-min-cut
primal-dual
multicommodity-flow
For any two non-isomorphic graphs $G, H$, does there exist a polysize, polylog quantifier depth first order formula which witnesses this?
graph-theory
graph-isomorphism
formulas
first-order-logic
Properties of toroidal graph
reference-request
graph-theory
graph-minor
topological-graph-theory
Common terminology used for lower/upper bounds
graph-theory
approximation-algorithms
optimization
lower-bounds
upper-bounds
Is there any good and free Introduction to topological graph theory
reference-request
graph-theory
co.combinatorics
survey
topological-graph-theory
Girth of graphs that decompose into two disjoint union of spanning trees
graph-theory
girth
spanning-tree
Complexity of finding semi-ordered Eulerian tours in a 4-regular graph
graph-theory
graph-algorithms
time-complexity
Minimum path edge-cover or minimum flow with unit capacities and DAGs
ds.algorithms
graph-theory
max-flow
One Generalization of Graph Isomorphism Problem
graph-theory
graph-algorithms
graph-isomorphism
Determining ties in random network centrality rankings?
graph-theory
graph-algorithms
Bipartite matching with degree domination
graph-theory
matching
Preference based group generator
ds.algorithms
graph-theory
Algorithm finding path with maximal ratio of white vertices
graph-theory
graph-algorithms
Complexity of listing all minimal cut sets / connected 2-partitions of a graph
graph-theory
Application of graph theory in computer science
graph-theory
co.combinatorics
big-list
application-of-theory
Ant colony optimization for traveling salesman problem with changing graph-nodes/vertices
ds.algorithms
graph-theory
tsp
heuristics
Minor and subdivision
graph-theory
graph-minor
Decomposition of edges of eulerian graph into maximum number of cycles
graph-theory
graph-algorithms
Best Hamiltonian Cycle Problem solver
graph-theory
hamiltonian-paths
Graceful labeling completion problems
cc.complexity-theory
reference-request
graph-theory
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
Book/ Monograph on graph minor theory [Reference request]
reference-request
graph-theory
graph-minor
Transitive Closure of Weighted Random Graphs?
graph-theory
graph-algorithms
transitive-closure
The algebraic connectivity of graphs with large isoperimetric number
graph-theory
spectral-graph-theory
Finding k shortest Paths with Eppstein's Algorithm
ds.algorithms
graph-theory
graph-algorithms
directed-acyclic-graph
Directed graph with bounded in-deg can be partitioned in a balanced way
graph-theory
co.combinatorics
pr.probability
randomized-algorithms
combinatorics
Almost regular subhypergraph of hypergraph with large minimal degree
graph-theory
co.combinatorics
matching
hypergraphs
Modifying Edmonds' Blossom Algorithm
ds.algorithms
graph-theory
graph-algorithms
optimization
Clique cover problem
graph-theory
graph-algorithms
np-hardness
approximation-algorithms
Graph factors of maximum weight
ds.algorithms
graph-theory
graph-algorithms
matching
What is known about counting bipartite perfect matching with average degree in $[2,3]$ and max degree $3$?
ds.algorithms
graph-theory
counting-complexity
permanent
bipartite-graphs
Existence of $d$-regular expander graph that can be represented as a bipartite graph
graph-theory
co.combinatorics
expanders
well-behaved outerplanar
graph-theory
reference clarification: Whitney's theorem on unique embeddability of 3-connected planar graphs?
reference-request
graph-theory
planar-graphs
ho.history-overview
Counting xyz-graphs in $\mathbb{Z}_n^3$
graph-theory
co.combinatorics
lower-bounds
hypergraphs
Lower bound on the largest restrained cubic subset
graph-theory
lower-bounds
hypergraphs
Graph rewriting with one-to-many pattern matching?
graph-theory
pl.programming-languages
term-rewriting-systems
Consequences of $\oplus \mathbf{P} \subseteq \mathbf{NP}$
cc.complexity-theory
graph-theory
complexity-classes
sat
counting-complexity
A conceptual question regarding hardness proofs by reduction
graph-theory
graph-algorithms
np-hardness
reductions
complexity-theory
Efficient update of reachable set of a node in a digraph
ds.algorithms
graph-theory
graph-algorithms
Graphs for which the number of shortest paths between every pair of vertices is polynomially bounded
reference-request
graph-theory
Is this vertex ordering optimization NP-Hard?
graph-theory
np-hardness
Graph addition chains
ds.algorithms
reference-request
graph-theory
co.combinatorics
treewidth