Pages that link to "Item:Q4167596"
From MaRDI portal
The following pages link to Finding a Minimum Circuit in a Graph (Q4167596):
Displaying 50 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- The jogger's problem (Q593786) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Complex network filtering and compression algorithm based on triangle-subgraph (Q782122) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- The complexity of determining a shortest cycle of even length (Q1052821) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Floorplanning by graph dualization: \(L\)-shaped modules (Q1310461) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- A shortest cycle for each vertex of a graph (Q1944201) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Bottleneck subset-type restricted matching problems (Q2023130) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Lengths of words accepted by nondeterministic finite automata (Q2203588) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Generating connected acyclic digraphs uniformly at random (Q2390252) (← links)
- Mind the gap! (Q2414857) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- An efficient algorithm for testing goal-minimality of graphs (Q2446346) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
