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 problemMaximum weight matchingMinimum k-cutMinimum cutIntersection numberClique problemGraph labelingLongest path problemDistanceEdge coloringPath graphMixed graphDimensionPlanarity testingGraceful labelingGraph partitionGraph isomorphism problemSubgraph isomorphism problemEdge coverMinimum bottleneck spanning treeDense graphPermutation graphNetwork flow problemGraph coloringClosest pair of points problemComplete graphEdge-transitive graphBipartite graphTransitive reductionConnectivityMinimum-cost flow problemReverse-delete algorithmComplement graphDirected graphMinimum spanning treeMetric k-centerMinimum bounding box algorithmsBin packing problemMenger's theoremGraph canonizationMultipartite graphNeighbourhoodSmallest-circle problemModular decompositionEdmonds' algorithmTree decompositionEquitable coloringGraph theoryDominating setLine graphPathQuantum graphInduced subgraphClique coverFlow networkAlgebraic graph theoryBidirectional searchMatrix chain multiplicationSnake-in-the-boxPolygon triangulationGraph traversalJohnson's algorithmEuclidean shortest pathSpectral graph theoryGraphBiconnected componentGraph fourier transformInduced pathMedian graphEuclidean minimum spanning treeConway's 99-graph problemMaximum subarray problemKarger's algorithmInteger programmingBridgeGauss circle problemOptimization problemDisk covering problemDual graphComplete bipartite graphTree-depthRegular graphPerfect graphFeedback vertex setHypercube graphEdge contractionOrientationSteiner tree problemSplit graphFeedback arc setPartition problemRoute inspection problemRamsey's theoremConvex hull of a simple polygonTreewidthSpanning treeCycle basisCheeger constantTwin-widthGraph edit distance