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.
Clique coverSubgraph isomorphism problemSplit graphCocliqueMaximum weight matchingCycle detectionMaximum subarray problemRange searchingClique numberJunction tree algorithmShortest path problemGraph traversalGraph isomorphism problemLongest path problemGraph bandwidthPerfect graphGraphClustering coefficientClosest pair of points problemCluster graphSmallest-circle problemLattice problemMetric k-centerAnt colony optimization algorithmsBlock graphRamsey's theoremInduced subgraphLongest increasing subsequenceAdjacency listMinimum k-cutPermutation graphKarger's algorithmEppstein's algorithmMinimum bounding box algorithmsDisjoint-set data structureDirected graphComputational geometryPolygon triangulationSnake-in-the-boxComplete graphHierarchical clusteringCluster analysisLongest common subsequence problemControl-flow graphKosaraju's algorithmPlanarity testingComplete bipartite graphRange minimum queryAnalysis of parallel algorithmsComputational topologyIntersection numberEuclidean shortest pathAdjacency matrixRecursionGraph theoryCycle graphConnectivityGraph partitionSearch problemComputability theoryDominating setComplement graphModular decompositionPartition problemComplexity classDense subgraphAlgebraic graph theoryAnalysis of algorithmsClosest stringConvex hull of a simple polygonComplexity theoryDistanceCycle basisTree decompositionParameterized complexityLongest common substring problemOptimal substructureFloyd-warshall algorithmCircuit complexityBeam searchComputational complexity theorySearch algorithmFibonacci search techniqueTrieSatisfiability modulo theoriesUtility graphMixed graphGraph canonizationJohnson's algorithmBinary space partitioningGraph rewritingCombinatorial optimizationCanadian traveller problemEdge coverSet cover problemMultipartite graphSpanning treeClique percolation methodComputational problemChinese postman problem