Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Januar 2005
Genre:	EDV / Informatik
	algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / algorithmicgeometry / combinatorialoptimization / ComputationalDiscreteMathematics / computationalgeometry / computationalgraphtheory / convexgeometry / datastructures / Datenbanken / Datenmanagement / Diskrete Mathematik / geometriccomputations / Geometrie / Grafikprogrammierung / Graph / Graph - Graphentheorie / graphalgorithms / graphcomputations / graphtheory / Hamiltoniancycle / Matching / Optimization / polygoncomputations / Raumlehre mehr...
ISBN:	9783540244011
EAN-Code:	9783540244011
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#3330 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D 14 mm
Gewicht:	371 gr
Seiten:	240
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

On Convex Developments of a Doubly-Covered Square.- Flat 2-Foldings of Convex Polygons.- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph.- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles.- Maximum Induced Matchings of Random Regular Graphs.- Antimagic Valuations for the Special Class of Plane Graphs.- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems.- Crossing Numbers and Skewness of Some Generalized Petersen Graphs.- Some Conditions for the Existence of (d,k)-Digraphs.- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs.- On a Triangle with the Maximum Area in a Planar Point Set.- A Balanced Interval of Two Sets of Points on a Line.- Spanning Trees of Multicoloured Point Sets with Few Intersections.- Regular Factors Containing a Given Hamiltonian Cycle.- Disjoint Edges in Topological Graphs.- The Decycling Number of Cubic Graphs.- Equal Area Polygons in Convex Bodies.- Maximum Order of Planar Digraphs.- (a,d)-Edge-Antimagic Total Labelings of Caterpillars.- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels.- Constructions for Nonhamiltonian Burkard-Hammer Graphs.- A Characterization of Polygonal Regions Searchable from the Boundary.- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.