1![On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin1 and Dimitrios M. Thilikos2 1 DEPARTMENT OF INFORMATICS On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin1 and Dimitrios M. Thilikos2 1 DEPARTMENT OF INFORMATICS](https://www.pdfsearch.io/img/eb812bcfd2c38257745b9586c75fbe62.jpg) | Add to Reading ListSource URL: users.uoa.gr- Date: 2014-06-11 17:30:33
|
---|
2![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 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](https://www.pdfsearch.io/img/93a8599664e019fcdfbc931b41db220f.jpg) | Add to Reading ListSource URL: page.math.tu-berlin.deLanguage: English |
---|
3![Combinatorial graph theory and connectivity Keith Briggs more.btexact.com/people/briggsk2/cgt.html Mathematics of Networks 2004 July Combinatorial graph theory and connectivity Keith Briggs more.btexact.com/people/briggsk2/cgt.html Mathematics of Networks 2004 July](https://www.pdfsearch.io/img/fb48f4cb2abf1c9de4f43004a8771cdf.jpg) | Add to Reading ListSource URL: www.monmeetings.orgLanguage: English - Date: 2015-09-04 10:25:17
|
---|
4![](https://www.pdfsearch.io/img/8ae684646d5ab9415c6ef74d36a49265.jpg) | Add to Reading ListSource URL: www-cc.cs.uni-saarland.deLanguage: English - Date: 2014-04-23 07:23:20
|
---|
5![43 Documenta Math. Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals 43 Documenta Math. Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals](https://www.pdfsearch.io/img/8375f0cb4d7f8c335b86e499ce47a192.jpg) | Add to Reading ListSource URL: www.math.uiuc.eduLanguage: English - Date: 2002-05-18 12:43:15
|
---|
6![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 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](https://www.pdfsearch.io/img/dec7f3028cedce8cff42b69a05c0326e.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2008-10-28 21:25:54
|
---|
7![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 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](https://www.pdfsearch.io/img/54fb6b4640813a54132257d01edf34cb.jpg) | Add to Reading ListSource URL: www.grosser.esLanguage: English - Date: 2010-07-25 08:26:30
|
---|
8![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 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](https://www.pdfsearch.io/img/1d29a93675b0486667c94d9b66536ab2.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2008-10-28 23:59:42
|
---|
9![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 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](https://www.pdfsearch.io/img/7047e55ad61ed08c50f8a265830042e7.jpg) | Add to Reading ListSource URL: www.math.vt.eduLanguage: English - Date: 2015-02-13 14:19:01
|
---|
10![Learning Bayesian Network Structure using LP Relaxations Tommi Jaakkola MIT CSAIL David Sontag Learning Bayesian Network Structure using LP Relaxations Tommi Jaakkola MIT CSAIL David Sontag](https://www.pdfsearch.io/img/ca40b215373507a326637d5648484c33.jpg) | Add to Reading ListSource URL: jmlr.orgLanguage: English - Date: 2010-03-31 18:51:07
|
---|