scientific article
From MaRDI portal
Publication:4003439
zbMath0755.68056MaRDI QIDQ4003439
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
coversconnectivitytreesmatchingsshortest pathsgraph algorithmsdominationindependent setscoloringdepth-first searchacyclic digraphsroutingfactors
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (37)
Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Node-to-set disjoint paths problem in star graphs ⋮ Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm ⋮ Node-to-node cluster fault tolerant routing in star graphs ⋮ The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings ⋮ Algorithms for approximate graph matching ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Towards the bi-directional cellular automaton model with perception ranges ⋮ Cluster fault-tolerant routing in star graphs ⋮ Polynomial solvability of cost-based abduction ⋮ On the computational complexity of ordered subgraph recognition ⋮ Eccentricity of networks with structural constraints ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ On-line graph algorithms for incremental compilation ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ On the maximum disjoint paths problem on edge-colored graphs ⋮ Partitioning multi-edge graphs ⋮ A Metropolis-Hastings based method for sampling from the \(G\)-Wishart distribution in Gaussian graphical models ⋮ Flanders' theorem for many matrices under commutativity assumptions ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Unnamed Item ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ Shape analysis for automated sulcal classification and parcellation of MRI data ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ Algorithms for computing parameters of graph-based extensions of BCH codes ⋮ A systolic algorithm for solving dense linear systems ⋮ A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem ⋮ A branch-and-cut algorithm for graph coloring ⋮ Directed graphs and Lie superalgebras of matrices ⋮ An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages ⋮ Pfaffian orientations and perfect matchings of scale-free networks ⋮ The capacity of monotonic functions ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ Distributed probabilistic polling and applications to proportionate agreement ⋮ The maximum clique problem ⋮ An improved genetic algorithm for facility layout problems having inner structure walls and passages ⋮ A systolic algorithm for dynamic programming
This page was built for publication:
