Cart (Loading....) | Create Account
Close category search window
 

Small induced-universal graphs and compact implicit graph representations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alstrup, S. ; IT Univ., Copenhagen, Denmark ; Rauhe, T.

We show that there exists a graph G with n · 2O(log* n) nodes, where any forest with n nodes is a node-induced subgraph of G. Furthermore, the result implies the existence of a graph with nk2O(log* n) nodes that contains all n-node graphs of fixed arboricity k as node-induced subgraphs. We provide a lower bound of Ω(nk) for the size of such a graph. The upper bound is obtained through a simple labeling scheme for parent queries in rooted trees.

Published in:

Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on

Date of Conference:

2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.