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.
Reverse-delete algorithmClique problemTree decompositionKarger's algorithmHierarchical clusteringDecision tree learningJohnson's algorithmClique percolation methodHierarchical dirichlet processNearest-neighbor chain algorithmEuler tour techniqueSplit graphAlgebraic graph theoryGraph neural networkPrim's algorithmCluster graphClustering coefficientBiconjugate gradient methodBidirectional searchDijkstra's algorithmKruskal's algorithmGraph rewritingMargin classifierEdmonds' algorithmAnt colony optimization algorithmsKosaraju's algorithmBeam searchNested sampling algorithmLink analysisKnowledge graphModular decompositionIterative deepening a*Graph theoryAncestral graphGraph partitionActive-set methodClenshaw algorithmSequential minimal optimizationBlossom algorithmGraphKnowledge graph embeddingAdjacency matrixAdjacency listClique coverColor-codingLarge margin nearest neighborTernary searchGradient boostingNeighbourhood components analysisInverse iterationDelta rulePruningConsensus clusteringSingle-linkage clusteringGraph edit distanceConjugate gradient methodJenks natural breaks optimizationManifold regularizationFeature learningGradient descentAdjoint state methodBehavior treeGraph traversalStatistical learning theoryData-flow analysisMatroidShortest path problemMm algorithmCriss-cross algorithmMoral graphMain path analysisJump flooding algorithmBetweenness centralityConnected-component labelingSequence labelingRelevance vector machineShortest path faster algorithmOptics algorithmGradient methodPolytreeDecision treeAffinity propagationInduced pathEvolutionary algorithmIntersection theoryGraph isomorphism problemBreadth-first searchProbabilistic neural networkComputational geometryLabel propagation algorithmComputational topologyTopological data analysisExtremal graph theoryGoertzel algorithmTabu searchBayesian knowledge tracingMirror descentLine detectionBest-first searchSpanning tree