Titlebook: Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen; Band 2: Vortragsausz L. Collatz,G. Meinardus,W. Wetterling Boo

Gum-Disease

Patrimony

服從

PSA-velocity

Strong Blocks and the Optimum Branching Problem,A complete characterization of the branching polytope on an arbitrary digraph in terms of linear inequalities was given by J. Edmonds, c.f. [2]. This description was refined by R. Giles (c.f. [3]) who showed which of these inequalities are essential, i.e. define facets of the branching polytope.

壓艙物

,über die Maximale Blockl?nge Optimaler Codes,We give a survey on the existence problem of not necessarily linear optimal codes. Using combinatorial methods from finite geometry we achieve some upper bounds for the block length 1 of certain optimal (l,k)-codes over an aiphabet consisting of n symbols.

Iniquitous

Some Remarks on a Classification of Oracle-Type-Algorithms,This paper deals with polynomial relations between different kinds of oracles for optimization problems over independence systems. Six different greedy algorithms as special oracle algorithms are also considered. A certain symmetry among problems and algorithms is established by dualization of independence systems.

G-spot

,Typen von Hypergraphen innerhalb und au?erhalb der Mathematik,lications are given for all these types, from geometry (configurations and geometrical processes), from algebra (group theory) from analysis (f.i. bifurcation in nonlinear integral equations) and from applications (population, network of railways, planning a.o.)

Gene408

,über Unendliche Graphen der Ebene,ll überraschenden Ph?nomenen bieten. Historisch ist dies wohl aus dem fast ausschlie?lichen Interesse an dem Vierfarbenproblem zu verstehen; nach einem bekannten Satz von Erd?s — de Bruijn [l] liefern hierzu die unendlichen Graphen der Ebene keine neuen Aspekte ..

同步信息

A Simple Algorithm for Maximum Matching of Graphs,ich labels the “even” nodes of Edmonds relative to a free node v performs a depth-first-search and occasionally contracts triples of vertices. The second algorithm constructs for a given even node w an edge set H which turns out to be an alternating path of even length from v to w by adding successively certain pairs of edges.

殺人

Duality Principles and the Algebraic Transportation Problem,oblem is described in terms of an ordered commutative semimodule over real numbers. The Solution method is based on duality principles which yield similar optimality criteria as known for the classical Hitchcock transportation problem.