- Home
- Publications
- Publication Search
- Publication Details
Title
Reconfiguration of maximum-weight b-matchings in a graph
Authors
Keywords
Combinatorial reconfiguration, Graph algorithm, <em class=EmphasisTypeItalic >b</em>-matching
Journal
JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-04-27
DOI
10.1007/s10878-018-0289-3
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Reconfiguration of Steiner Trees in an Unweighted Graph
- (2017) Haruka MIZUTA et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- (2017) Amer E. Mouawad et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Reconfiguration of Steiner Trees in an Unweighted Graph
- (2017) Haruka MIZUTA et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- Reconfiguration of Vertex Covers in a Graph
- (2016) Takehiro ITO et al. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- The complexity of dominating set reconfiguration
- (2016) Arash Haddadan et al. THEORETICAL COMPUTER SCIENCE
- Reconfiguration of Vertex Covers in a Graph
- (2016) Takehiro ITO et al. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
- (2015) Tatsuhiko HATANAKA et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT
- Linear-time algorithm for sliding tokens on trees
- (2015) Erik D. Demaine et al. THEORETICAL COMPUTER SCIENCE
- The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
- (2015) Tatsuhiko HATANAKA et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- The k-Dominating Graph
- (2013) R. Haas et al. GRAPHS AND COMBINATORICS
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- (2012) Marthe Bonamy et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Complexity of independent set reconfigurability problems
- (2012) Marcin Kamiński et al. THEORETICAL COMPUTER SCIENCE
- An exact algorithm for the Boolean connectivity problem for k-CNF
- (2011) Kazuhisa Makino et al. THEORETICAL COMPUTER SCIENCE
- On the complexity of reconfiguration problems
- (2010) Takehiro Ito et al. THEORETICAL COMPUTER SCIENCE
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- (2009) Parikshit Gopalan et al. SIAM JOURNAL ON COMPUTING
- Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
- (2009) Paul Bonsma et al. THEORETICAL COMPUTER SCIENCE
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreDiscover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversation