<we><edit> <!-- questions and answers -->
closure-properties
regular-expressions
weighted-graphs
graphs
algorithm-analysis
dynamic-programming
automata
space-complexity
functional-programming
binary-trees
context-free
compilers
complexity-theory
computer-networks
sorting
parallel-computing
undecidability
quantum-computing
search-algorithms
graph-traversal
recursion
matrices
neural-networks
reference-request
strings
graph-theory
Distance between $u$ and $v$ is the same as distance between $v$ and $u$ in a transposed graph?
graphs
graph-theory
Subgraph of paths of a graph has cycles?
graphs
graph-theory
Question about Complete partially Directed Acyclic Graph
graph-theory
Why line graph is a proper subclass of claw-free graph?
graphs
graph-theory
Is this problem just an application of traveling salesman? If not is it some other already "solved" problem?
graphs
graph-theory
optimization
modelling
Best game rating algorithm for punctual games with rating+variance : is Glicko-2 satisfying?
graph-theory
probability-theory
How to find a Graph Embedding given a metric space?
graphs
graph-theory
Question regarding terminology used to describe Benes networks
graph-theory
parallel-computing
routing
How to find total number of minimum spanning trees in a graph with n edges?
graph-theory
spanning-trees
Applying graph "adjustment" algorithms to Elo rating system
graphs
graph-theory
statistics
Do we need visited flags when applying BFS on a tree?
graphs
graph-theory
trees
search-algorithms
What is the formal way to prove this is still a minimum spanning tree?
algorithms
graphs
graph-theory
data-structures
minimum-spanning-tree
Machine learning for labelling a directed graph
graph-theory
machine-learning
Where is the second face in a graph with 3 nodes?
graphs
graph-theory
planar-graphs
Understanding time complexity of a while loop that will look over all vertices and edges
graph-theory
time-complexity
asymptotics
graph-traversal
Find longest path in graph with N nodes and N edges
graphs
graph-theory
weighted-graphs
Finding if there exists a vertex that can be reached by all other vertices
algorithms
graphs
graph-theory
graph-traversal
Removing vertices that belong to a given set from a graph
graph-theory
graph-traversal
Do we generally store the degree of each vertex in the linked list implementation? if not, why?
graph-theory
data-structures
Minimum path cover--- Disjointed paths with minimum total number of edges
algorithms
graphs
graph-theory
optimization
Finding shortest path involving additional restrictions
algorithms
graphs
graph-theory
Given an oriented graph, return true if paths have a specified length
graph-theory
shortest-path
graph-traversal
Algebraic (spectral) algorithms for the minimum spanning tree problem
algorithms
graph-theory
minimum-spanning-tree
Number of automorphism for clique of 6 vertices minus two non adjacent edges
algorithms
graphs
graph-theory
Knight's Tour Parberry algorithm: 4 knight's tour merge procedure
algorithms
graphs
graph-theory
time-complexity
recursion
Minimum capacity cut reduction from digraph with two edge weight sets
graphs
graph-theory
optimization
combinatorics
network-flow
Multi-trip travel salesman problem
complexity-theory
graph-theory
combinatorics
P = NP and Polynomial Reductions
complexity-theory
graph-theory
np-complete
np-hard
np
Why does A* fail to find the fastest path when it reaches the goal?
graphs
graph-theory
shortest-path
Eigenvalue computation for large graph
graphs
graph-theory
time-complexity
linear-algebra
adjacency-matrix
Fitness model for scale free networks
algorithms
graph-theory
randomness
enumeration
random-graphs
Decreasing the weight of one edge of minimum spanning tree, prove the MST is unchanged
graphs
graph-theory
weighted-graphs
minimum-spanning-tree
Enumerate all (n-1) edge disjoint perfect matchings in complete (undirected) graphs
algorithms
graph-theory
matching
What is the significance of negative weight edges in a graph?
algorithms
graph-theory
Recalculating dominance after changing the entry node
graphs
graph-theory
Longest-Path Layering algorithm
graphs
graph-theory
graph-traversal
graph-drawing
Shortest path on a dynamic multigraph
graph-theory
shortest-path
Space complexity for connectivity problem with given graph diameter
graph-theory
space-complexity
Do the edges in the least cost paths given by Bellman-Ford algorithm produce a spanning tree?
algorithms
graph-theory
Finding The Shortest Path In Scotland Yard?
algorithms
graphs
graph-theory
shortest-path
Is there a difference between perfect, full and complete tree?
graph-theory
terminology
trees
Is there a reasonable algorithm to generate a certain "independent clique graph" with minimal vertices?
graph-theory
clique
Generalized Geography problem time and space complexity
graph-theory
time-complexity
space-complexity
Reversing topo-order of the original graph instead of the topo-order of the transposed graph?
graph-theory
Finding arcs between strongly connected components
algorithms
graphs
graph-theory
How to efficiently compute the most isolated point?
algorithms
graph-theory
computational-geometry
nearest-neighbour
Find a path that contains specific nodes without back and forward edges
algorithms
graphs
graph-theory
shortest-path
graph-traversal
How to deal with cost variation in a dynamic graph when applying Dijkstra
graphs
graph-theory
shortest-path
graph-traversal
What is a reducible flow graph?
graphs
graph-theory
network-flow
is it possible to determine using a single depth-first search, in O(V+E) time, whether a directed graph is singly connected?
graphs
graph-theory
graph-traversal
Dependency graph with general (AND/OR) dependencies
graph-theory
Printing all paths of a tree and sorting the weight of edges
algorithms
complexity-theory
graph-theory
graph-traversal
Complexity of increasing the radius of a graph
complexity-theory
graph-theory
np-hard
Covering a complete graph with n copies of an arbitrary graph: NP-complete?
algorithms
complexity-theory
graphs
graph-theory
np-complete
minimum subgraph whose cost is greater than a predefined threshold
graphs
graph-theory
weighted-graphs
Graph Algorithm (Modification on Dijkstra?) : Tech Interview
algorithms
graphs
graph-theory
shortest-path
How can I partition a graph such that as few edges as possible cross partition boundaries?
algorithms
graph-theory
optimization
Pruning a powerset based on a graph
algorithms
graphs
graph-theory
sets
Insertion Heuristics to the TSP Problem
algorithms
graph-theory
greedy-algorithms
heuristics
Greedy Heuristic for the Traveling Salesperson Problem
algorithms
graph-theory
computational-geometry
greedy-algorithms
heuristics
A Question about a Question related to Graph Theory and Maximum Flow
graph-theory
The Number of Paths in a Directed Graph
algorithms
graph-theory
Algorithm to compute shape and volume of polyhedrons (polytope) formed by finite planes
graph-theory
computational-geometry
Partition a graph such that each subgraph fits the machine constraint
algorithms
graphs
graph-theory
Equivalence between two definitions of Tree width
graph-theory
parameterized-complexity
Where can I find a data set of graphs with known domination numbers?
graph-theory
graphs
How to find the path for the most negatively-weighted cycle which goes through a specific source node?
algorithms
graphs
graph-theory
weighted-graphs
What graph theory algorithm(s) would help solve this problem?
algorithms
graphs
graph-theory
Proving a factor 2 performance guarantee for a greedy minimum cardinality vertex cover algorithm (Exercise)
graphs
graph-theory
combinatorics
approximation
Graph families with high $k$-community
graphs
graph-theory
clustering
How to find m directed paths connecting the maximal number of vertices in an unweighted directed acyclic graph?
algorithms
graph-theory
polynomial-time
Looking for a good algorithm to divide the nodes of a complete graph into groups
algorithms
graphs
graph-theory
Maximum number of not overlapping cycles in an undirected graph
graph-theory
computational-geometry
weighted-graphs
Assign team members to groups to maximize outcome
graph-theory
combinatorics
What does a wedge in a graph look like?
graph-theory
terminology
How is reachability reduced to order maintenance?
algorithms
graphs
graph-theory
Edge contraction in DAG
graphs
graph-theory
Enumerating pairs of disconnected cliques in a graph
graphs
graph-theory
Perfect matching in a bipartite regular graph in linear time
algorithms
graph-theory
network-flow
matching
bipartite-matching
Convert DAG whose transitive reduction is non-planar to a planar DAG with same transitive closure
graphs
graph-theory
planar-graphs
Size of flow in a flow network with a vertex in the middle
algorithms
graph-theory
network-flow
Graph algorithm or framework for determining node affinity based on utilities
algorithms
graphs
graph-theory
data-structures
Edge removal to convert a non-planar DAG to a planar DAG while maintaining reachability?
graphs
graph-theory
planar-graphs
Bipartite Perfect Matching "Assignment Problem" - finding an assignment of a particular weight
graph-theory
linear-programming
enumeration
bipartite-matching
assignment-problem
Between every two MST's there's a series of "nearby" MST's
graph-theory
minimum-spanning-tree
Find all the cumulative sums in a DAG
algorithms
graphs
graph-theory
time-complexity
dynamic-programming
Two criteria for an edge to belong to all MSTs
graphs
graph-theory
minimum-spanning-tree
What is the maximum possible degrees of a vertex of an MST
graph-theory
minimum-spanning-tree
Remove parallel edges in a directed graph in linear time
algorithms
graphs
graph-theory
How to minimally extend a digraph such that all nodes are on a cycle?
graphs
graph-theory
graph-traversal
Complexity of Two problems graphs with cycle
complexity-theory
graph-theory
np-complete
Complexity of the problem to determine if a spanning tree exists inside a connected graph
complexity-theory
graph-theory
Are all vertices within a strongly connected component with 2 or more vertices part of a cycle?
graphs
graph-theory
Shortest Path using at most k colors
formal-languages
graph-theory
shortest-path
routing
Finding mergable groups in a directed graph
algorithms
graph-theory
Expander Graph - Is the following graph family an expander graph?
graph-theory
expanders
Maximum independent set in progressive k-partite graphs
algorithms
graph-theory
np-complete
Would it be feasible to use a breadth first search algorithm for finding a solution to the 3x3x3 rubiks cube?
algorithms
graph-theory
Determine if a vertex is a part of a cycle in O(m+n) complexity
graphs
graph-theory
graph-traversal
Minimum sub-tree of a graph that covers each color at least once
graphs
graph-theory
spanning-trees
minimum-spanning-tree