MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Graph isomorphism problemClique problemPlanarity testingInduced subgraphHamiltonian path problemShortest path problemLongest path problemPartition problemEdge-transitive graphGraph homologyGraphPermutation graphCircuit satisfiability problemMaximum weight matchingEuclidean shortest pathAlgebraic graph theoryTree decompositionGraph rewritingGraph homomorphismGraph isomorphismComplement graph2-satisfiabilityClosest pair of points problemBirational geometryGraph theorySatisfiability modulo theoriesFunction problemSpanning treeMaximum subarray problemHomeomorphismSpectral graph theorySearch problemTheory of computationIntersection theoryCycle detectionModel of computationGraph bandwidthInduced pathGraph canonizationGraph edit distanceRange searchingLongest common subsequence problemGroup isomorphismComputational topologyPolygon triangulationGraph traversalDistanceClosed graph theoremKnowledge graph embeddingBipartite graphMetric k-centerConnectivitySnake-in-the-boxComputational problemGraph fourier transformEdge coloringIntersection numberPoint in polygonClosest stringSymmetric graphGraph labelingCircuit complexityDirected graphGraph drawingNetwork flow problemEigenvalue perturbationGraph automorphismTransitive reductionGraph coloringHamiltonian simulationBoolean satisfiability problemHomographyHurewicz theoremAlgebraic combinatoricsIsomorphism theoremsReverse-delete algorithmComplete graphComputational complexity theorySmallest-circle problemHodge conjectureHorn-satisfiabilityMoral graphLongest common substring problemParameterized complexityModular decompositionIterative deepening a*Longest increasing subsequencePath graphRepresentation theoremSubgroupCycle graphClique coverGeometric hashingCycle basisSupersingular isogeny graphAlgorithmic information theoryMixed graphBiconnected componentAnt colony optimization algorithmsAdjacency matrix