On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin1 and Dimitrios M. Thilikos2 1 DEPARTMENT OF INFORMATICS

Source URL: users.uoa.gr

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Source URL: page.math.tu-berlin.de

• Graph theory
• Kneser graph
• Petersen graph
• Odd graph
• Hamiltonian path
• Graph
• Cycle
• Planar graphs
• Desargues graph
• Polyhedral graph

Combinatorial graph theory and connectivity Keith Briggs more.btexact.com/people/briggsk2/cgt.html Mathematics of Networks 2004 July

Source URL: www.monmeetings.org

• Graph theory
• Mathematics
• Discrete mathematics
• Graph
• Analytic combinatorics
• Polyhedral graph

PDF Document

Source URL: www-cc.cs.uni-saarland.de

• Graph
• Graph theory
• Matching
• Edge
• Convex hull
• Polyhedral combinatorics
• Tutte embedding

43 Documenta Math. Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals

Source URL: www.math.uiuc.edu

• Planar graphs
• Duality
• Differential geometry of surfaces
• Circle packing theorem
• Polyhedral graph
• Lattice graph
• Line graph
• Upward planar drawing
• 1-planar graph

Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent

Source URL: cccg.ca

• Network theory
• NP-complete problems
• Shortest path problem
• Steiner tree problem
• Routing algorithms
• Graph theory
• Theoretical computer science
• Mathematics

GRAPHITE Two Years After First Lessons Learned From Real-World Polyhedral Compilation Konrad Trifunovic2 , Albert Cohen2 , David Edelsohn3 , Li Feng6 , Tobias Grosser5 , Harsha Jagasia1 , Razya Ladelsky4 , Sebastian Pop1

Source URL: www.grosser.es

• Computer programming
• Loop optimization
• Static single assignment form
• Polytope model
• Graphite
• Dependence analysis
• GNU Compiler Collection
• Vectorization
• Control flow graph
• Computing
• Compiler optimizations
• Software engineering

Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomial

Source URL: cccg.ca

• Convex polytope
• Linear programming
• Duality
• Tree
• Graph
• Abstract polytope
• Polyhedral combinatorics
• Geometry
• Polytopes
• Mathematics

SQUARING RECTANGLES: THE FINITE RIEMANN MAPPING THEOREM J. W. Cannon, W. J. Floyd and W. R. Parry Abstract. The classical Riemann mapping theorem asserts that any topological quadrilateral in the complex plane can be map

Source URL: www.math.vt.edu

• Topological graph theory
• Polyhedral combinatorics
• Quadrilaterals
• Rectangle
• Riemann surface
• Tessellation
• Euler characteristic
• Geometry
• Mathematics
• Topology

Learning Bayesian Network Structure using LP Relaxations Tommi Jaakkola MIT CSAIL David Sontag

Source URL: jmlr.org

• Applied mathematics
• Linear programming
• Convex optimization
• Constraint programming
• Linear programming relaxation
• Bayesian network
• Directed acyclic graph
• Duality
• Polyhedral combinatorics
• Mathematical optimization
• Mathematics
• Operations research