Using matrices to link conflict evolution and resolution in a graph model
DOI10.1016/J.EJOR.2010.03.025zbMATH Open1205.05233OpenAlexW1987798963MaRDI QIDQ992610FDOQ992610
Authors: D. Marc Kilgour, Graeme Kemkes, Haiyan Xu, Keith William Hipel 
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.025
Recommendations
- A matrix approach to status quo analysis in the graph model for conflict resolution
- Status quo analysis in the graph model for conflict resolution
- Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences
- Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution
- Choice stabilities in the graph model for conflict resolution
incidence matrixgraph model for conflict resolutionstatus quo analysiscolored pathunilateral improvement arc-incidence matrixunilateral move arc-incidence matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of group decision and negotiation
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Backtrack Programming
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- The graph model for conflicts
- Title not available (Why is that?)
- Status quo analysis in the graph model for conflict resolution
- An extension of labeling techniques for finding shortest path trees
- Paths and trails in edge-colored graphs
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- Conflict models in graph form: Solution concepts and their interrelationships
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- A matrix approach to status quo analysis in the graph model for conflict resolution
- A Search Procedure for Hamilton Paths and Circuits
- Colouring paths in directed symmetric trees with applications to WDM routing
Cited In (25)
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
- On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
- Some conditions for the existence of Euler \(H\)-trails
- A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China
- Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution
- Mixed stabilities for analyzing opponents' heterogeneous behavior within the graph model for conflict resolution
- Matrix representations of the inverse problem in the graph model for conflict resolution
- \(H\)-cycles in \(H\)-colored multigraphs
- Theory and implementation of coalitional analysis in cooperative decision making
- Status quo analysis in the graph model for conflict resolution
- A generalization of properly colored paths and cycles in edge-colored graphs
- Matrix representations of Berge stabilities in the graph model for conflict resolution
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- A hierarchical graph model for conflict resolution with sequential moves
- Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm
- The graph model for conflicts
- A matrix approach to status quo analysis in the graph model for conflict resolution
- Conflict models in graph form: Solution concepts and their interrelationships
- Matrix representation and extension of coalition analysis in group decision support
- Alternating-pancyclism in 2-edge-colored graphs
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
- Theory and application of conflict resolution with hybrid preference in colored graphs
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
This page was built for publication: Using matrices to link conflict evolution and resolution in a graph model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992610)
