A matrix-based approach to searching colored paths in a weighted colored multidigraph

DOI10.1016/j.amc.2009.04.086zbMath1175.05066OpenAlexW1974539284MaRDI QIDQ732496

Kevin W. Li, D. Marc Kilgour, Keith William Hipel, Hai-Yan Xu

Publication date: 9 October 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://scholar.uwindsor.ca/cgi/viewcontent.cgi?article=1063&context=odettepub

zbMATH Keywords

decision makingadjacency matrixgraph model for conflict resolutionedge-colored pathsedge-weighted-colored multidigraphstatus quo analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (9)

On the tractability of shortest path problems in weighted edge-coloured graphs ⋮ Alternating-pancyclism in 2-edge-colored graphs ⋮ Matrix representation and extension of coalition analysis in group decision support ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ An integrated algebraic approach to conflict resolution with three-level preference ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Using matrices to link conflict evolution and resolution in a graph model ⋮ Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Signed graphs with negative self evaluation and clusterability of graphs
• An algorithm to find all paths between two nodes in a graph
• A matrix approach to status quo analysis in the graph model for conflict resolution
• The graph model for conflicts
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Dioïds and semirings: Links to fuzzy sets and other applications
• Group decision support for hazards planning and emergency management: a group analytic network process (GANP) approach
• Strength of preference in graph models for multiple-decision-maker conflicts
• A discrete-time recurrent neural network for shortest-path routing
• A Search Procedure for Hamilton Paths and Circuits
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Computation of prime implicants using matrix and paths
• Status quo analysis in the graph model for conflict resolution
• The edge versus path incidence matrix of series-parallel graphs and greedy packing

This page was built for publication: A matrix-based approach to searching colored paths in a weighted colored multidigraph