<we><edit> <!-- questions and answers -->
circuits
hash
cpu-cache
pumping-lemma
logic
semantics
approximation
search-trees
complexity-theory
graph-theory
image-processing
heuristics
dynamic-programming
landau-notation
computer-vision
nondeterminism
randomness
halting-problem
pushdown-automata
algorithm-analysis
machine-learning
terminology
np
type-theory
cryptography
graphs
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
Algorithms for solving Flow game
graphs
colorings
Finding bicliques in a bipartite graph of minimum size
graphs
approximation
clique
Is the problem of traversing every vertex of a graph (not necessarily once) without crossing an edge more than once in P?
algorithms
complexity-theory
graphs
np-complete
np-hard
Push Relabel Max Flow Topcoder Tutuorial Problems
algorithms
graphs
graph-theory
network-flow
Why do we use Bellman ford instead of Dijkstra's Algorithm?
algorithms
graphs
weighted-graphs
Predecessor-subgraph property
graphs
algorithm-analysis
Find the center node on a weighted, non-directed graph
graphs
weighted-graphs
Dynamic graph (?) - combination of connections between vertices that for each 3 exist min 1 edge
algorithms
graphs
dynamic-programming
Uniformly randomly generating an "unlockable" graph
algorithms
graphs
Dijkstra's algorithm: why are distances initialized to infinity and not some negative number?
algorithms
graphs
Boruvka MST algorithm using doubly linked lists
algorithms
graphs
minimum-spanning-tree
shortest cycle passing through vertices a and b with changeable edge weights
graphs
shortest-path
Covering a complete graph with n copies of an arbitrary graph: NP-complete?
algorithms
complexity-theory
graphs
graph-theory
np-complete
Finding k-nearest neighbors to a set of nodes in a large graph
algorithms
graphs
optimization
approximation
nearest-neighbour
Is this problem just an application of traveling salesman? If not is it some other already "solved" problem?
graphs
graph-theory
optimization
modelling
Data structure on graph able to remove edges and find sink
graphs
data-structures
searching
Map overlay, any algorithm for face updating step?
graphs
computational-geometry
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 to define a language for an independent set problem of a graph?
formal-languages
graphs
weight constrained shortest path problem variants
complexity-theory
graphs
np-complete
shortest-path
Applying graph "adjustment" algorithms to Elo rating system
graphs
graph-theory
statistics
Is there an algorithm to compute the shortest Hamiltonian path in an directed graph from one point to another in polynomial time?
graphs
Bellman Ford for directed graph G finds shortest paths within one iteration
algorithms
graphs
Algorithm to find nodes with given a distance
algorithms
graphs
trees
binary-trees
graph-traversal
Code for graph embedding into the line
graphs
Pruning a powerset based on a graph
algorithms
graphs
graph-theory
sets
Algorithm to find individual, closed groups of lines in a large set of connected lines
algorithms
graphs
using mappings in order to reduce k-SUM to k-clique
complexity-theory
graphs
reductions
Disconnecting graph (and subgraphs) by removing fewest amount of edges - NP completeness
algorithms
graphs
np-complete
Alternative algorithm for minimum spanning tree construction
algorithms
graphs
correctness-proof
minimum-spanning-tree
deadlock caused by a cyle of locks ? unprobable event causing it or just a false intuition
graphs
parallel-computing
deadlocks
Modeling an inequality problem to a graph
algorithms
graphs
Minimum edge cover with a constraint
graphs
trees
time complexity to check if there is an edge between two nodes in an adjacency list
graphs
algorithm-analysis
data-structures
runtime-analysis
Defining preferred paths makes $A^*$ heuristic lose admissibility
graphs
shortest-path
heuristics
Moving an edge in a weighted tree to maximize longest path length
graphs
optimization
discrete-mathematics
Finding shortest path involving additional restrictions
algorithms
graphs
graph-theory
Recovering species from a phylogenetic tree
algorithms
graphs
bioinformatics
Number of automorphism for clique of 6 vertices minus two non adjacent edges
algorithms
graphs
graph-theory
Dijkstra's shortest path algorithm without relaxation
algorithms
graphs
shortest-path
Embedding trees of diameter four is NP-hard
graphs
np-complete
Appropriate graph clustering algorithm
algorithms
graphs
clustering
graphs notations
complexity-theory
graphs
Partition a graph such that each subgraph fits the machine constraint
algorithms
graphs
graph-theory
solving max cut problem on a huge graph (500 x 500) using Semidefinite Programming with CVXOPT
graphs
optimization
max-cut
Where can I find a data set of graphs with known domination numbers?
graph-theory
graphs
Algorithm for 3-object matching
algorithms
graphs
time-complexity
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
Eigenvalue computation for large graph
graphs
graph-theory
time-complexity
linear-algebra
adjacency-matrix
Cross link suggestion algorithm that distributes and spans all links as fast as possible without loops
algorithms
graphs
trees
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
Finding all unique paths from a source to a sink in a specially-formed DAG
graphs
time-complexity
Testing if a given DAG is a lattice
graphs
lattices
order-theory
Number of nodes of height $h$ in a heap or almost complete binary tree
graphs
trees
binary-trees
heaps
Decreasing the weight of one edge of minimum spanning tree, prove the MST is unchanged
graphs
graph-theory
weighted-graphs
minimum-spanning-tree
Extending ordered tree edit distance to DAGs
graphs
edit-distance
Proving NP hardness about graph creation
graphs
np-complete
np-hard
np
Definition of a reachable ancestor (Skiena TADM 2nd ed section 5.9.2)
graphs
Looking for a good algorithm to divide the nodes of a complete graph into groups
algorithms
graphs
graph-theory
Distance vector in a weighted graph
algorithms
graphs
how to prove original intervals and canonical form of intervals have the same interval graph
graphs
proof-techniques
intervals
Finding maximum-cardinality independent set with a particular oracle
algorithms
graphs
reductions
Intuitive proof for Floyd's cycle detection algorithm
algorithms
graphs
correctness-proof
Checking if there is a single path that visits all nodes in a directed graph
graphs
How is reachability reduced to order maintenance?
algorithms
graphs
graph-theory
Edge contraction in DAG
graphs
graph-theory
Having trouble proving vertex cover greedy algorithm
algorithms
graphs
np-complete
np-hard
np
Short cycle detection complexity?
algorithms
graphs
Enumerating pairs of disconnected cliques in a graph
graphs
graph-theory
Algorithm - Checking if an unconnected graph is cyclical
algorithms
graphs
Convert DAG whose transitive reduction is non-planar to a planar DAG with same transitive closure
graphs
graph-theory
planar-graphs
Undirected graph find minimal wight sum so every cycle has at least one weighted edge included
algorithms
graphs
Algorithms for procedural generated mazes
algorithms
graphs
randomized-algorithms
spanning-trees
computer-games
Finding all vertices on negative cycles
algorithms
graphs
shortest-path
Merge Leaf labeled trees
algorithms
graphs
algorithm-analysis
time-complexity
trees
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
Find a path that contains specific nodes without back and forward edges
algorithms
graphs
graph-theory
shortest-path
graph-traversal
Find all the cumulative sums in a DAG
algorithms
graphs
graph-theory
time-complexity
dynamic-programming
How to deal with cost variation in a dynamic graph when applying Dijkstra
graphs
graph-theory
shortest-path
graph-traversal
A path modification problem in directed graphs
algorithms
graphs
routing
social-networks
Two criteria for an edge to belong to all MSTs
graphs
graph-theory
minimum-spanning-tree
What is a reducible flow graph?
graphs
graph-theory
network-flow
Minimal semiprime congruence problem
graphs
modular-arithmetic
Remove parallel edges in a directed graph in linear time
algorithms
graphs
graph-theory
Avoiding loops in Bellman-Ford algorithm
algorithms
graphs
shortest-path
weighted-graphs
Algorythm for creating Number-Rows
algorithms
graphs
algorithm-analysis
greedy-algorithms
number-theory
How to minimally extend a digraph such that all nodes are on a cycle?
graphs
graph-theory
graph-traversal
Show that Knapsack-like problem on directed graph is NP-hard
complexity-theory
graphs
np-hard
Are all vertices within a strongly connected component with 2 or more vertices part of a cycle?
graphs
graph-theory
Applicability of Dijkstra's algorithm to hypergraphs
algorithms
graphs
shortest-path
Seek to infer "correct" route from sequence of stops
algorithms
graphs
routing
Is there metrics for knowlege graph enrichment?
graphs
ontologies
How to generate a list of all graphs with maximum degree D and diameter smaller than P?
algorithms
graphs
How to calculate the centrality index of a edge in multiple source sink max-flow min cut algorithm?
algorithms
graphs
network-flow
ford-fulkerson
Determine if a vertex is a part of a cycle in O(m+n) complexity
graphs
graph-theory
graph-traversal