Pages that link to "Item:Q1168744"
From MaRDI portal
The following pages link to Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744):
Displaying 50 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Optimal-depth sorting networks (Q340576) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The module isomorphism problem reconsidered. (Q468724) (← links)
- On the automorphism groups of strongly regular graphs. II. (Q468725) (← links)
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Learning an efficient constructive sampler for graphs (Q511780) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Computing the composition factors of a permutation group in polynomial time (Q581532) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- The smallest non-autograph (Q726638) (← links)
- Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation (Q733697) (← links)
- Efficient comparison of program slices (Q758192) (← links)
- Quadratic forms and the graph isomorphism problem (Q810529) (← links)
- Matching graphs with unique node labels (Q851709) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- Symmetric blocking (Q897931) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- Isomorphism identification of graphs: especially for the graphs of kinematic chains (Q959075) (← links)
- On the power of combinatorial and spectral invariants (Q962126) (← links)
- On the asymmetric complexity of the group-intersection problem (Q963437) (← links)
- A parametric filtering algorithm for the graph isomorphism problem (Q1020495) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Sylow's theorem in polynomial time (Q1063109) (← links)
- Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\) (Q1077933) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
- A polynomial bound for the orders of primitive solvable groups (Q1166603) (← links)
- On the orders of primitive groups with restricted nonabelian composition factors (Q1168415) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- A note on compact graphs (Q1174181) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- On the diameter of permutation groups (Q1197618) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- On the coding of ordered graphs (Q1266307) (← links)
- A graph isomorphism algorithm for object recognition (Q1273874) (← links)
