Degree-Constrained Orientations of Embedded Graphs

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Conference object 01 Jan 2012Publisher:Springer Berlin HeidelbergJournal:Journal of Combinatorial Optimization, volume 31, pages 758-773 (issn: 1382-6905, eissn: 1573-2886,

Copyright policy )

Authors: Disser, Yann; Matuschke, Jannik;

doi: 10.1007/978-3-642-35261-4_53 , 10.1007/s10878-014-9786-1

Degree-Constrained Orientations of Embedded Graphs

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

ETH Zurich
Switzerland
Technical University of Berlin
Germany
Technical University of Berlin
Germany
Institute of Theoretical Computer Science
Switzerland

Keywords

graph embeddings, fixed-parameter tractability, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), complexity theory, planar graphs, Planar graphs; geometric and topological aspects of graph theory, graph orientation

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average