We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Optimal Trees and Branchings II / Shortest Paths I

00:00
subtitles
off
playback rate
1
subtitles
off
Deutsch (auto-generated)
playback rate
0.25
0.5
0.75
1
1.25
1.5
1.75
2
quality
576p
 Cite
 Share
 Download Purchase
Technische Universität Darmstadt
 Weihe, Karsten

Formal Metadata

Title
Optimal Trees and Branchings II / Shortest Paths I
Title of Series
Part Number
6
Number of Parts
Author
License
CC Attribution - ShareAlike 3.0 Germany:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor and the work or content is shared also in adapted form only under the conditions of this
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
Auf Basis analytischer Sachverhalte entwickeln wir algorithmische Ideen für Verfahren auf Graphen. Daraus entstehen zunächst generische Verfahren, welche formal bezüglich ihrer Korrektheit und Laufzeit analysiert werden. Im Anschluss daran werden in jedem Kapitel Techniken zur Verbesserung und Beschleunigung vorgestellt. Abgerundet wird der Stoffplan durch zahlreiche Modellierungs- und Anwendungsbeispiele und der (optionalen) Implementierung eines Benchmarks verschiedener algorithmischer Varianten.
00:00
Mathematical optimizationMaxima and minimaEquals signSet (mathematics)SubsetNetwork topologyKanteSpanning treeChain complexSummationWeightStress (mechanics)Zusammenhang <Mathematik>Connected spaceModulformGreatest elementComputer animation
03:15
Mathematical optimizationFundamental theorem of algebraComplex (psychology)Decision theoryWeightGraph (mathematics)Graph (mathematics)SubgraphInclusion mapCategory of beingProof theoryDuality (mathematics)Inclusion mapKanteSet (mathematics)EquationCompass (drafting)Inequality (mathematics)Film editingChain complex8 (number)Lecture/ConferenceComputer animation
09:34
Graph (mathematics)WeightSubgraphMathematical optimizationGraph (mathematics)Inclusion mapCategory of beingProof theoryVertex (graph theory)AirfoilInsertion lossGroup actionKanteKopplung <Physik>Set (mathematics)Stress (mechanics)Graph (mathematics)Chain complexSubgraphComputer animation
15:51
Proof theoryFeasibility studyLemma (mathematics)Graph (mathematics)Uniqueness quantificationWeightGraph (mathematics)Maxima and minimaMathematical optimizationVertex (graph theory)Directed graphStress (mechanics)TheoryKanteConnected spaceZusammenhang <Mathematik>TheoremChain complexVertex (graph theory)Computer animation
24:22
Graph (mathematics)Alpha (investment)WeightGraph (mathematics)Maxima and minimaMathematical optimizationVertex (graph theory)TheoremProof theorySign (mathematics)Function (mathematics)Rule of inferenceBinary fileChain complexKanteStress (mechanics)Musical ensembleQuoteHausdorff spaceComputer animation
32:54
Maß <Mathematik>Equals signMathematical optimizationMach's principleGraph (mathematics)Correspondence (mathematics)Arrow of timeTransformation (genetics)KanteField extensionWeightStress (mechanics)QuoteNumberMusical ensembleCompass (drafting)Maß <Mathematik>Matching (graph theory)Chain complexComputer animation
41:25
Mathematical optimizationWeightGraph (mathematics)Vertex (graph theory)Axiom of choicePhase transitionNegative numberThermal expansionTheoremTravelling salesman problemBound stateNetwork topologyStandard deviationMaxima and minimaForestChain complexHausdorff spaceKanteRekursiver AlgorithmusSet (mathematics)Stress (mechanics)Series (mathematics)Moment (mathematics)Diagram
47:12
ForestMathematical optimizationStandard deviationGraph (mathematics)Boom barrierDirected graphLengthMaxima and minimaEnumerated typeTotal S.A.Complete metric spaceEstimationVertex (graph theory)Physical systemMatroidSubsetElement (mathematics)Independence (probability theory)Function (mathematics)Proof theoryPairwise comparisonSet theoryCategory of beingNegative numberTwin primeHamiltonian (quantum mechanics)Link (knot theory)Graph (mathematics)Reduction of orderMatching (graph theory)Bound stateDistanceSupremumMatroidKanteGraph (mathematics)Negative numberLengthSummationParallelenDesire pathWeightNormaleSpanning treeWegeproblemUniverse (mathematics)Chain complexSubsetStress (mechanics)Unit of lengthSet (mathematics)EnergieComputer animation
56:04
Mathematical optimizationIterationInfinityBound stateDistanceGraph (mathematics)LengthVertex (graph theory)Category of beingUniqueness quantificationDirected graphNetwork topologyWurzelbaumExistenceVector spaceArc (geometry)Range (statistics)Military operationDesire pathMoment (mathematics)Direction (geometry)Graph (mathematics)Network topologyKanteWurzelbaumTrailLengthComputer animation
01:04:42
DistanceMilitary operationTwin primeMereologySequenceBooby trapProof theoryDirected graphNegative numberWurzelbaumOperations researchLink (knot theory)Range (statistics)Network topologyLengthStress (mechanics)LogicLink (knot theory)KanteWeightMoment (mathematics)Military operationDesire pathQuoteP-valueComputer animation
01:13:20
LengthFunction (mathematics)Directed graphSet theoryRadical (chemistry)Term (mathematics)Proof theoryLengthStress (mechanics)State of matterEquationPerimeterIterationCoefficient of determinationP-valueComputer animation
01:21:58
Insertion lossNegative numberWeightAxiom of choiceInequality (mathematics)Proof theoryGraph (mathematics)Military operationDistanceTotal S.A.Operations researchObject (grammar)Queue (abstract data type)Maxima and minimaPriority queueIterationLaufzeitSet (mathematics)Greatest elementLengthSquareMaximum (disambiguation)MathematicsSequenceLogicEnde <Graphentheorie>EckeRoundingFactorizationTrailEigenvalues and eigenvectorsMoment (mathematics)Computer animation
01:30:35
Binary fileCategory of beingElement (mathematics)Network topologyAlgebraic structureNegative numberGraph (mathematics)Operations researchRule of inferenceMathematical structure
Transcript: Deutsch(auto-generated)