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.
Shortest path problemLongest common subsequence problemLongest common substring problemMaximum weight matchingLongest increasing subsequenceDistanceInduced pathLongest palindromic substringSnake-in-the-boxEuclidean shortest pathPath graphMetric k-centerGraph isomorphism problemGraph theoryK shortest path routingPlanarity testingAlgebraic graph theoryCanadian traveller problemGeneralized assignment problemComputational problemGraph canonizationComplete graphOptimization problemClique problemCycle detectionCycle basisBidirectional searchSubgraph isomorphism problemSearch problemTime complexityDijkstra's algorithmTreeReachabilityGraph bandwidthMaximum subarray problemGraphPathDirected graphBetweenness centralityClosest pair of points problemReverse-delete algorithmBiconnected componentJohnson's algorithmRoute inspection problemIterative deepening a*Closed graph theoremMaximal independent setMatrix chain multiplicationChromatic polynomialMoral graphKarger's algorithmPermutation patternMaximum coverage problemGraph homologyAverage path lengthSatisfiability modulo theoriesTree decompositionPermutation graphClosest stringExtremal graph theoryGraph traversalSpanning treeLink predictionIntersection numberHamiltonian path problemCircuit complexityLattice problemGraph edit distanceTraveling purchaser problemEuclidean distanceContour integrationDistance from a point to a lineGeodesicAdjacency matrixGeneral topologyMultigraphAnt colony optimization algorithmsMathematical problemModular decompositionAdjacency listLength functionPolytreeGraph rewritingGeometric graph theoryEdge-transitive graphTheory of computationComponentTwin-widthMixed graphComplexity classAlgorithmDense subgraphOptimal substructureMinimum bounding box algorithmsTopological graph theoryDiophantine geometryComparison of topologiesDense graphNonlinear programmingOptimization