"graph" nach Englisch mit Beispielen - Kollokationen-Wörterbuch Englisch
- Given a graph G, find a maximum cut.
- Thus, we may find the period of a strongly connected graph G by the following steps:
- Start with graph G, which contains a list of edges E.
- Thus far, all of the nodes that will appear in the graph G have been specified.
- Again, the graph G is encoded as a string.
- The graph G is the structure of the computer network.
- We must allow each embedded graph G to "cheat" in two limited ways.
- An infinite graph G may be made into a topological space in two different but related ways:
- More generally, a result of makes it possible to find in any graph G the ear decomposition with the fewest even ears.
- A graph G is said to be k-factorable if it admits a k-factorization.
Klicken Sie die ausgewählten Überschrift, um die Gruppe von Kollokationen, Kollokationen und Beispielsätze einzublenden .