18 research outputs found
Obstructions to within a few vertices or edges of acyclic
Finite obstruction sets for lower ideals in the minor order are guaranteed to
exist by the Graph Minor Theorem. It has been known for several years that, in
principle, obstruction sets can be mechanically computed for most natural lower
ideals. In this paper, we describe a general-purpose method for finding
obstructions by using a bounded treewidth (or pathwidth) search. We illustrate
this approach by characterizing certain families of cycle-cover graphs based on
the two well-known problems: -{\sc Feedback Vertex Set} and -{\sc
Feedback Edge Set}. Our search is based on a number of algorithmic strategies
by which large constants can be mitigated, including a randomized strategy for
obtaining proofs of minimality.Comment: 16 page
Planar graphs : a historical perspective.
The field of graph theory has been indubitably influenced by the study of planar graphs. This thesis, consisting of five chapters, is a historical account of the origins and development of concepts pertaining to planar graphs and their applications. The first chapter serves as an introduction to the history of graph theory, including early studies of graph theory tools such as paths, circuits, and trees. The second chapter pertains to the relationship between polyhedra and planar graphs, specifically the result of Euler concerning the number of vertices, edges, and faces of a polyhedron. Counterexamples and generalizations of Euler\u27s formula are also discussed. Chapter III describes the background in recreational mathematics of the graphs of K5 and K3,3 and their importance to the first characterization of planar graphs by Kuratowski. Further characterizations of planar graphs by Whitney, Wagner, and MacLane are also addressed. The focus of Chapter IV is the history and eventual proof of the four-color theorem, although it also includes a discussion of generalizations involving coloring maps on surfaces of higher genus. The final chapter gives a number of measurements of a graph\u27s closeness to planarity, including the concepts of crossing number, thickness, splitting number, and coarseness. The chapter conclused with a discussion of two other coloring problems - Heawood\u27s empire problem and Ringel\u27s earth-moon problem
Surfaces, Tree-Width, Clique-Minors, and Partitions
In 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph may be partitioned into two subsets, each of which induces an outerplanar graph. Some partial results towards this conjecture are presented. One such result, in which a planar graph may be thus edge partitioned into two series-parallel graphs, has nice generalizations for graphs embedded onto an arbitrary surface and graphs with no large clique-minor. Several open questions are raised. © 2000 Academic Press
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
From 8th to 13th July 2007, the Dagstuhl Seminar ``Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Structural and Topological Graph Theory and Well-Quasi-Ordering
Στη σειρά εργασιών Ελασσόνων Γραφημάτων, οι Neil Robertson και Paul Seymour
μεταξύ άλλων σπουδαίων αποτελεσμάτων, απέδειξαν την εικασία του Wagner που σήμερα
είναι γνωστή ως το Θεώρημα των Robertson και Seymour.
Σε κάθε τους βήμα προς την συναγωγή της τελικής απόδειξης
της εικασίας, κάθε ειδική περίπτωση αυτής που αποδείκνυαν ήταν συνέπεια ενός "δομικού θεωρήματος"
το οποίο σε γενικές γραμμές ισχυριζόταν ότι ικανοποιητικά γενικά γραφήματα περιέχουν ως ελάσσονα γραφήματα
ή άλλες δομές που είναι χρήσιμα για την απόδειξη, ή ισοδύναμα, ότι η δομή των
γραφημάτων τα οποία δεν περιέχουν ένα χρήσιμο για την απόδειξη γράφημα ως έλασσον
είναι κατά κάποιο τρόπο περιορισμένη συνάγοντας έτσι και πάλι μια χρήσιμη πληροφορία για την απόδειξη.
Στην παρούσα εργασία, παρουσιάζουμε -σχετικά μικρές- αποδείξεις διαφόρων ειδικών περιπτώσεων του Θεωρήματος των Robertson και Seymour,
αναδεικνύοντας με αυτό τον τρόπο την αλληλεπίδραση της δομικής θεωρίας γραφημάτων με την θεωρία των
καλών-σχεδόν-διατάξεων.
Παρουσιάζουμε ακόμα την ίσως πιο ενδιαφέρουσα ειδική περίπτωση του Θεωρήματος των Robertson και Seymour,
η οποία ισχυρίζεται ότι η εμβαπτισιμότητα
σε κάθε συγκεκριμένη επιφάνεια δύναται να χαρακτηριστεί μέσω της απαγόρευσης πεπερασμένων το πλήθος γραφημάτων
ως ελάσσονα. Το τελευταίο αποτέλεσμα συνάγεται ως ένα αποτέλεσμα της θεωρίας των καλών-σχεδόν-διατάξεων
αναδεικνύοντας με αυτό τον τρόπο την αλληλεπίδρασή της με την τοπολογική θεωρία γραφημάτων. Τέλος, σταχυολογούμε
αποτελέσματα αναφορικά με την καλή-σχεδόν-διάταξη κλάσεων γραφημάτων από άλλες -πέραν της
σχέσης έλασσον- σχέσεις γραφημάτων.In their Graph Minors series, Neil Robertson and Paul Seymour among other great results
proved Wagner's conjecture which is today known as the Robertson and Seymour's theorem.
In every step along their way to the final proof, each special case of the conjecture which they were proving
was a consequence of a "structure theorem", that sufficiently general graphs contain
minors or other sub-objects that are useful for the proof - or equivalently,
that graphs that do not contain a useful minor have a certain restricted structure, deducing that way also a useful information for the proof.
The main object of this thesis is the presentation of -relatively short-
proofs of several Robertson and Seymour's theorem's special cases, illustrating by this way the interplay between
structural graph theory and graphs' well-quasi-ordering.
We present also the proof of the perhaps most important special case of the Robertson and Seymour's theorem
which states that embeddability in any fixed surface can be characterized by forbidding finitely many minors.
The later result is deduced as a well-quasi-ordering result,
indicating by this way the interplay among topological graph theory and well-quasi-ordering theory.
Finally, we survey results regarding the well-quasi-ordering of graphs by other than the minor graphs' relations
MinorObstructions for Apex Pseudoforests
Ένα γράφημα ανήκει στην κλάση των ψευδοδασών αν κάθε συνεκτική συνιστώσα του
περιέχει το πολύ έναν κύκλο. Ένα γράφημα είναι απόγειοψευδοδάσος αν μπορεί να
μετατραπεί σε ψευδοδάσος με την αφαίρεση μίας κορυφής. Έχουμε εντοπίσει τα 33
γραφήματα τα οποία αποτελούν το σύνολο παρεμπόδισης για την κλάση γραφημάτων
απόγειαψευδοδάση, δηλαδή τα ελαχιστικά γραφήματα ως προς την σχέση του
ελάσσονος, τα οποία δεν είναι απόγειαψευδοδάση.A graph is called a pseudoforest if none of its connected components contains more
than one cycle. A graph is an apexpseudoforest if it can become a pseudoforest by
removing one of its vertices. We identify 33 graphs that form the minor obstruction set
of the class of apexpseudoforests, i.e., the set of all minorminimal graphs that are not
apexpseudoforests
NASA SERC 1990 Symposium on VLSI Design
This document contains papers presented at the first annual NASA Symposium on VLSI Design. NASA's involvement in this event demonstrates a need for research and development in high performance computing. High performance computing addresses problems faced by the scientific and industrial communities. High performance computing is needed in: (1) real-time manipulation of large data sets; (2) advanced systems control of spacecraft; (3) digital data transmission, error correction, and image compression; and (4) expert system control of spacecraft. Clearly, a valuable technology in meeting these needs is Very Large Scale Integration (VLSI). This conference addresses the following issues in VLSI design: (1) system architectures; (2) electronics; (3) algorithms; and (4) CAD tools
Bryn Mawr College Undergraduate College Catalogue and Calendar, 1998-1999
https://repository.brynmawr.edu/bmc_calendars/1055/thumbnail.jp
Bryn Mawr College Undergraduate College Catalogue and Calendar, 1998-1999
https://repository.brynmawr.edu/bmc_calendars/1055/thumbnail.jp
Recommended from our members
Phenomenon and Abstraction: Coordinating Concepts in Music Theory and Analysis
This dissertation explores the habits of thought that inform how music analysts conceptualize the music they study and how this conceptualization affects the kinds of claims they make and the discursive practices adopted to express them. I aim to clarify these issues in music-theoretical conceptualization with an eye toward mediating analytical disagreements by tracing the influence of two types of concepts used in contemporary music analysis. I differentiate what I call theoretical concepts, which refer to abstract, theoretical objects, from phenomenal concepts, which refer to elements of felt, musical experience. Drawing on theories of concepts from philosophy of mind, I argue that these concepts have a complex structure, featuring both a reference and mode of presentation. The musical concept Dominant, for instance, might be used as a phenomenal concept, referring to the conscious experience of hearing a dominant, or it might be used as a theoretical concept, referring to a kind of abstract object, presented as either the triad the leads to the tonic or the triad built on scale degree five. In analysis, the kinds of concepts that analysts use will determine the scope of their analyses as well as define what sorts of critiques are best deployed against them.
I explore four different ways that these conceptual types are used. These case studies include conceptually simple theories that attempt to foreground one type of concept or another (from the formalized model proffered by Eugene Narmour, to the drawing-analyses of Elaine Barkin) as well as more common analytical strategies that rely on both kinds of concept in concert, such as Schenkerian analysis and transformational and neo-Riemannian theory. I enrich my study of analytical approaches with insights drawn from my own analytical practice, including a wide range of styles and composers (though foregrounding the complexity of tonal analysis especially) and close readings of various authors in different analytical traditions. In general, I am concerned less with testing the soundness of any given approach than with understanding what ways of conceptualizing music underlie them and how analysts coordinate these concepts in practice. I find that while most approaches rely on both types of concept in some combination, their differences come in the roles these concepts play in analytical methodology and the degree to which each type of engagement is foregrounded in practice