Winning Fast in Sparse Graph Construction Games

Volume 17
Issue 06 - Nov 2008
Add to Basket £30.00 / $45.00
Request Permissions
Cited by Articles (CrossRef)
Cited by Articles (Google Scholar)
Citation Alert
Go to Next Abstract in TOC
Go to Previous Abstract in TOC
Blog this Article close

Copy and paste this code to insert a reference to this article in your blog or online community profile:

Highlight All
<div style="background: #FFFFFF; margin: 10px 10px 10px 10px; padding: 10px 10px 10px 20px; text-align: left; border-top: 1px dashed #a5bbd1; border-left: 10px solid #a5bbd1; font-family: Verdana, Geneva, sans-serif;"><br> <div style="font-size: 12px; padding: 0px 0px 10px 0px; font-weight:bold; color: #003366;">Winning Fast in Sparse Graph Construction Games</div><br><div style="font-size: 10px;"><b>OHAD N. FELDHEIM and MICHAEL KRIVELEVICH (2008).</b><br /> <a href="http://journals.cambridge.org/action/displayJournal?jid=CPC">Combinatorics, Probability and Computing</a>, <a href="http://journals.cambridge.org/action/displayJournal?jid=CPC&volumeId=17&bVolume=y#loc17 ">Volume 17</a>, <a href="http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=17&issueId=06&iid=2474688"> Issue 06</a>, November 2008 pp 781-791 <br/> <a href="http://journals.cambridge.org/action/displayAbstract?aid=2474688">http://journals.cambridge.org/action/displayAbstract?aid=2474688</a></div></div>
The code will display like this:

Winning Fast in Sparse Graph Construction Games

OHAD N. FELDHEIM and MICHAEL KRIVELEVICH (2008).
Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008 pp 781-791 http://journals.cambridge.org/action/displayAbstract?aid=2474688

Blog this Article

Combinatorics, Probability and Computing (2008), 17 : 781-791 Cambridge University Press

doi:10.1017/S0963548308009401 (About doi)

Published online by Cambridge University Press 07 Oct 2008

Social Bookmarking

Username or Email Address	Password

Cambridge Journals Online

Combinatorics, Probability and Computing (2008), 17 : 781-791 Cambridge University Press

doi:10.1017/S0963548308009401 (About doi)

Published online by Cambridge University Press 07 Oct 2008