Finding a Minimum Circuit in a Graph
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Detecting directed 4-cycles still faster
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- The complexity of determining a shortest cycle of even length
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- A simple algorithm for finding a cycle of length greater than three and without diagonals
- Planar orientations with low out-degree and compaction of adjacency matrices
- Floorplanning by graph dualization: \(L\)-shaped modules
- A nice class for the vertex packing problem
- Efficient enumeration of graph orientations with sources
- Are unique subgraphs not easier to find?
- Efficient algorithms for subgraph listing
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- An efficient exact algorithm for triangle listing in large graphs
- A shortest cycle for each vertex of a graph
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Bottleneck subset-type restricted matching problems
- Detecting and enumerating small induced subgraphs in c-closed graphs
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- Lengths of words accepted by nondeterministic finite automata
- Online recognition of dictionary with one gap
- Fooling views: a new lower bound technique for distributed computations under congestion
- Generating connected acyclic digraphs uniformly at random
- Mind the gap!
- Complexity of finding graph roots with girth conditions
- An efficient algorithm for testing goal-minimality of graphs
- Open problems around exact algorithms
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Map graphs having witnesses of large girth
- Counting subgraphs in relational event graphs
- An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs
- Clique counting in MapReduce: algorithms and experiments
- Unique subgraphs are not easier to find
- Quantum complexity of Boolean matrix multiplication and related problems
- Algorithms Solving the Matching Cut Problem
- Finding and counting small induced subgraphs efficiently
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Star-shaped and L-shaped orthogonal drawings
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Time windowed data structures for graphs
- On the first-order complexity of induced subgraph isomorphism
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Random Generation of Directed Acyclic Graphs
- Dynamic set intersection
- The Null Space Problem I. Complexity
- Parameterized complexity of \(k\)-Chinese postman problem
- Extended dynamic subgraph statistics using h-index parameterized data structures
- Approximately counting triangles in sublinear time
- Finding even cycles even faster
- Conditional hardness for sensitivity problems
- Why do simple algorithms for triangle enumeration work in the real world?
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
- Triangles and girth in disk graphs and transmission graphs
- Tensor network complexity of multilinear maps
- Graph pattern polynomials
- Counting connected subgraphs with maximum-degree-aware sieving
- Faster approximation algorithms for computing shortest cycles on weighted graphs
- A weighted perfect matching with constraints on weights of its parts
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Packing cycles faster than Erdős-Pósa
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Improved output-sensitive quantum algorithms for Boolean matrix multiplication
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- Counting Subgraphs in Degenerate Graphs
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- The jogger's problem
- Uniform random generation of large acyclic digraphs
- Counting Homomorphic Cycles in Degenerate Graphs
- Streaming deletion problems Parameterized by vertex cover
- scientific article; zbMATH DE number 7770055 (Why is no real title available?)
- Computing and listing avoidable vertices and paths
- Finding and counting small induced subgraphs efficiently
- Approximate core allocations for edge cover games
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity
- Finding small complete subgraphs efficiently
- Dominoes
- Computing and listing avoidable vertices and paths
- Parallel Discovery of Top-k Weighted Motifs in Large Graphs
- Fast distributed algorithms for girth, cycles and small subgraphs
- Approximate core allocations for edge cover games
- Getting linear time in graphs of bounded neighborhood diversity
- Finding and counting small tournaments in large tournaments
- Finding and counting given length cycles
- Towards optimal set-disjointness and set-intersection data structures
- Conditionally optimal approximation algorithms for the girth of a directed graph
- Complexity of linear operators
- The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
- \textsf{PANDA}: query evaluation in submodular width
- On the complexity of fixed parameter clique and dominating set
- Fully dynamic algorithms for minimum weight cycle and related problems
- A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
- Improved algorithms for perfect graphs and odd holes
- Into the square: on the complexity of some quadratic-time solvable problems
- Improved simulation of nondeterministic Turing machines
- Complex network filtering and compression algorithm based on triangle-subgraph
This page was built for publication: Finding a Minimum Circuit in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167596)
