Suchergebnisse - "combinatorics) Keywords"

Polyominoes on twisted cylinders

Autoren: Gill Barequet Mira Shalah The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Gill Barequet Mira Shalah The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.computational-geometry.org/SoCG-videos/socg13video/Barequet-Shalah-Polyominoes-Twisted-Cylinders.pdf.

Schlagwörter: Categories and Subject Descriptors G.2.1 [Mathematics of Computing, Discrete Mathematics—Combinatorics Keywords Polyominoes, polycubes

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.2867

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.2867
http://www.computational-geometry.org/SoCG-videos/socg13video/Barequet-Shalah-Polyominoes-Twisted-Cylinders.pdf

Multinerves and Helly Numbers of Acyclic Families

Autoren: Éric Colin de Verdière Grégory Ginot Xavier Goaoc et al.

Weitere Verfasser: Éric Colin de Verdière Grégory Ginot Xavier Goaoc et al.

Quelle: http://www.di.ens.fr/users/colin/textes/08helly-socg.pdf.

Schlagwörter: Categories and Subject Descriptors, G.2.1 [Mathematics of Computing, Discrete Mathematics—Combinatorics Keywords, acyclic family, combinatorics, geometric transversal theory, good cover, Helly’s theorem, multinerve, nerve, spectral

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.260.956

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.260.956
http://www.di.ens.fr/users/colin/textes/08helly-socg.pdf

A Dualistic Approach to Bounding the Chromatic Number of a Graph

Autoren: Jaroslav Nesetril Claude Tardiff The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Jaroslav Nesetril Claude Tardiff The Pennsylvania State University CiteSeerX Archives

Quelle: http://kam.mff.cuni.cz/~kamserie/serie/clanky/2001/s538.ps.gz.

Schlagwörter: AMS classication, 05C15 (primary, graph coloring) 68R05 (secondary, combinatorics) Keywords, Graphs, Homomorphisms, Chromatic number, Duality, Extremal theory

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.310; http://kam.mff.cuni.cz/~kamserie/serie/clanky/2001/s538.ps.gz

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.310
http://kam.mff.cuni.cz/~kamserie/serie/clanky/2001/s538.ps.gz

The Structural Properties of Even Free Graphs

Autoren: T. Chalapathi The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: T. Chalapathi The Pennsylvania State University CiteSeerX Archives

Quelle: http://research.ijcaonline.org/volume121/number2/pxc3904476.pdf.

Schlagwörter: General Terms Graph theory, Group theory and Combinatorics. Keywords Even integers group, Even free graph, Cycles, Bipartite and Complete Bipartite graph

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.695.2541; http://research.ijcaonline.org/volume121/number2/pxc3904476.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.695.2541
http://research.ijcaonline.org/volume121/number2/pxc3904476.pdf

LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time ∗

Autoren: Jessica Chang Samir Khuller Koyel Mukherjee et al.

Weitere Verfasser: Jessica Chang Samir Khuller Koyel Mukherjee et al.

Quelle: http://www.cs.umd.edu/~samir/grant/spaa14.pdf.

Schlagwörter: Categories and Subject Descriptors F.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling, G.2 [Discrete Mathematics, Combinatorics Keywords busy time, scheduling, packing

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.7391; http://www.cs.umd.edu/~samir/grant/spaa14.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.7391
http://www.cs.umd.edu/~samir/grant/spaa14.pdf