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.
Minimum spanning treeMinimum cutShortest path problemTreeReverse-delete algorithmSpanning treeInduced pathComplete graphGraph bandwidthMinimum-cost flow problemTree-depthTransitive reductionMinimum k-cutDistanceKruskal's algorithmDense graphEuclidean minimum spanning treeTree decompositionEdmonds' algorithmEdge coverGraph partitionNeighbourhoodIntersection numberEdge-transitive graphComponentPath graphBasic feasible solutionBidirectional searchGraph minorMedian graphCycle basisGeometric medianDirected graphCageLongest path problemMenger's theoremPolytreeDominating setCheeger constantConvex hull of a simple polygonBiconnected componentConnectivityOptimal binary search treeK-edge-connected graphEdge contractionBridgeMixed graphSplitPrim's algorithmMinimax theoremFeedback arc setReachabilityStrongly connected componentKarger's algorithmTreewidthFriedman's sscg functionBiconnected graphJohnson's algorithmTransitive closureClique coverDimensionMinimum bounding boxDegeneracyFlow networkPermutation graphBetweenness centralityDistance from a point to a lineMoral graphShortest path faster algorithmMaximum weight matchingEdge coloringGraphMultigraphExpenditure functionBeam searchPerfect graphTopological sortingLocal optimumOrientationMinimum bounding box algorithmsSymmetric graphAverage path lengthChordal graphCycleLowest common ancestorCycle graphCloseness centralityComplement graphSplit graphModular decompositionMinimum efficient scaleJunction tree algorithmLine graphDense subgraphComplete boolean algebraMinimal surfaceM-ary treePathRegular graphHamiltonian path