In mathematics, the queue number of a graph is a graph invariant defined analogously to stack number (book thickness) using first-in first-out (queueâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

Whether buying stocks or playing the slots, people making real-world risky decisions often rely on their experiences with theâ€¦Â (More)

Is this relevant?

2010

2010

- Giuseppe Di Battista, Fabrizio Frati, JÃ¡nos Pach
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

We prove that planar graphs have poly-logarithmic queue number, thus improving upon the previous polynomial upper boundâ€¦Â (More)

Is this relevant?

2009

2009

- Geir T. Helleloid, Madeeha Khalid, David Petrie Moulton, Philip Matchett Wood
- Discrete Mathematics
- 2009

In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like â€œpegging movesâ€¦Â (More)

Is this relevant?

Review

2005

Review

2005

- Ilona Heldal, Anthony Steed, Maria Spante, Ralph Schroeder, Sophia Bengtsson, Marja Partanen
- Presence
- 2005

Virtual environments systems based on immersive projection technologies (IPTs) offer users the possibility to collaborateâ€¦Â (More)

Is this relevant?

2004

2004

- JÃ³zsef Balogh, Pascal Ochem, AndrÃ¡s PluhÃ¡r
- Journal of Graph Theory
- 2004

The interval number of a graph G is the least natural number t such that G is the intersection graph of sets, each of which isâ€¦Â (More)

Is this relevant?

2003

2003

- Emilio Di Giacomo, H J A Meijer
- Graph Drawing
- 2003

A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. Theâ€¦Â (More)

Is this relevant?

2001

2001

- Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu
- Discrete Mathematics
- 2001

A graph G=(V; E) is said to be an integral sum graph (sum graph) if its vertices can be given a labeling with distinct integersâ€¦Â (More)

Is this relevant?

2001

2001

- Yan Wang, Bolian Liu
- Discrete Mathematics
- 2001

Let N denote the set of positive integers. The sum graph G(S) of a 1nite subset S of N is the graph (S; E) with vertex set S andâ€¦Â (More)

Is this relevant?

1997

1997

- T. A. Clarke, Robert Hochberg, Glenn H. Hurlbert
- Journal of Graph Theory
- 1997

Results regarding the pebbling number of various graphs are presented. We say a graph is of Class 0 if its pebbling number equalsâ€¦Â (More)

Is this relevant?

1992

1992

- Miller Puckette, Cort Lippe
- ICMC
- 1992

Score following was first presented at the 1984 ICMC, independently, by Barry Vercoe and Roger Dannenburg. By 1987, IRCAM wasâ€¦Â (More)

Is this relevant?