scientific article; zbMATH DE number 2081019
From MaRDI portal
Publication:4474120
zbMath1077.68725MaRDI QIDQ4474120
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230537.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
An \(O(n\log n)\) algorithm for finding edge span of cacti ⋮ List covering of regular multigraphs ⋮ Distance Constrained Labelings of Trees ⋮ Comparing Universal Covers in Polynomial Time ⋮ List covering of regular multigraphs with semi-edges ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Exact algorithm for graph homomorphism and locally injective graph homomorphism ⋮ Complexity of Locally Injective Homomorphism to the Theta Graphs ⋮ Locally Injective Homomorphism to the Simple Weight Graphs ⋮ On the computational complexity of partial covers of theta graphs ⋮ Computing role assignments of chordal graphs ⋮ The complexity of locally injective homomorphisms ⋮ Comparing universal covers in polynomial time ⋮ A complete complexity classification of the role assignment problem
This page was built for publication:
