The complexity of 2-vertex-connected orientation in mixed graphs.
Florian HörschZoltán SzigetiPublished in: Discret. Optim. (2023)
Keyphrases
- directed graph
- labeled graphs
- undirected graph
- computational complexity
- computational cost
- attributed graphs
- decision problems
- graph matching
- database
- graph structure
- space complexity
- graph theoretic
- graph theory
- hamiltonian cycle
- series parallel
- complexity analysis
- bipartite graph
- connected components
- search algorithm
- neural network