Soft happy colourings and community structure of networks
Fuente:
arXiv
Saved in:
| Main Authors: | Shekarriz, Mohammad H., Thiruvady, Dhananjay, Nazari, Asef, Lewis, Rhyd |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Finding happiness by evolutionary algorithms
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Overcoming Tight Constraints in Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2026)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2026)
An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks
by: Corcoran, Padraig, et al.
Published: (2025)
by: Corcoran, Padraig, et al.
Published: (2025)
A note on hardness of promise hypergraph colouring
by: Wrochna, Marcin
Published: (2022)
by: Wrochna, Marcin
Published: (2022)
On the complexity of the Maker-Breaker happy vertex game
by: Hilaire, Mathieu, et al.
Published: (2026)
by: Hilaire, Mathieu, et al.
Published: (2026)
Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)
by: Chuet, Quentin, et al.
Published: (2022)
Backbone colouring of chordal graphs
by: Araújo, Júlio, et al.
Published: (2025)
by: Araújo, Júlio, et al.
Published: (2025)
Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)
by: Corsini, Timothée, et al.
Published: (2025)
Majority Boolean networks classifying density: structural characterization and complexity
by: Perrot, Kévin, et al.
Published: (2026)
by: Perrot, Kévin, et al.
Published: (2026)
Star colouring and locally constrained graph homomorphisms
by: Antony, Cyriac, et al.
Published: (2023)
by: Antony, Cyriac, et al.
Published: (2023)
On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025)
by: Chuet, Quentin, et al.
Published: (2025)
Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)
by: Groenland, Carla, et al.
Published: (2026)
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)
by: Beaudou, Laurent, et al.
Published: (2021)
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
by: Falgas-Ravry, Victor, et al.
Published: (2022)
by: Falgas-Ravry, Victor, et al.
Published: (2022)
Trapping and commutative Boolean networks
by: Gadouleau, Maximilien
Published: (2026)
by: Gadouleau, Maximilien
Published: (2026)
The formula for the completion time of project networks
by: Castejón-Limas, Manuel, et al.
Published: (2024)
by: Castejón-Limas, Manuel, et al.
Published: (2024)
Approximation Algorithms for Optimal Hopsets
by: Dinitz, Michael, et al.
Published: (2025)
by: Dinitz, Michael, et al.
Published: (2025)
Optimal Trading of a Charging-Station Company in Auction Markets for Electricity
by: Sohrabi, Farnaz, et al.
Published: (2025)
by: Sohrabi, Farnaz, et al.
Published: (2025)
Contribution to Blocker and Interdiction optimization problems in networks
by: Martin, Sébastien
Published: (2024)
by: Martin, Sébastien
Published: (2024)
Phenotype control and elimination of variables in Boolean networks
by: Tonello, Elisa, et al.
Published: (2024)
by: Tonello, Elisa, et al.
Published: (2024)
Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
by: Schwieger, Robert, et al.
Published: (2023)
by: Schwieger, Robert, et al.
Published: (2023)
A Boolean encoding of the Most Permissive semantics for Boolean networks
by: de Chancel, Laure, et al.
Published: (2026)
by: de Chancel, Laure, et al.
Published: (2026)
Creation of fixed points in block-parallel Boolean automata networks
by: Perrot, Kévin, et al.
Published: (2025)
by: Perrot, Kévin, et al.
Published: (2025)
Agglomeration based influential node ranking in path-type networks
by: Berberler, Zeynep Nihan, et al.
Published: (2025)
by: Berberler, Zeynep Nihan, et al.
Published: (2025)
Fast solutions to k-parity and k-synchronisation using parallel automata networks
by: Perrotin, Pacôme, et al.
Published: (2024)
by: Perrotin, Pacôme, et al.
Published: (2024)
Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
by: Nakajima, Tamio-Vesa, et al.
Published: (2025)
by: Nakajima, Tamio-Vesa, et al.
Published: (2025)
A logarithmic approximation of linearly ordered colourings
by: Håstad, Johan, et al.
Published: (2024)
by: Håstad, Johan, et al.
Published: (2024)
Colourings of $(m, n)$-coloured mixed graphs
by: MacGillivray, Gary, et al.
Published: (2020)
by: MacGillivray, Gary, et al.
Published: (2020)
Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels
by: Bourgeais, Quentin, et al.
Published: (2025)
by: Bourgeais, Quentin, et al.
Published: (2025)
Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
by: Espinoza, Alonso, et al.
Published: (2025)
by: Espinoza, Alonso, et al.
Published: (2025)
Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)
by: Bridoux, Florian, et al.
Published: (2024)
A statistical test for network similarity
by: Miasnikof, Pierre, et al.
Published: (2025)
by: Miasnikof, Pierre, et al.
Published: (2025)
Strong modules and asynchronous attractors of Boolean networks
by: Ruet, Paul
Published: (2026)
by: Ruet, Paul
Published: (2026)
Interaction graphs of isomorphic automata networks II: universal dynamics
by: Bridoux, Florian, et al.
Published: (2024)
by: Bridoux, Florian, et al.
Published: (2024)
On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)
by: Gollin, J. Pascal, et al.
Published: (2025)
A Systematic Study of Single-Anchor Logical Gadgets
by: Güngör, Fikret H.
Published: (2025)
by: Güngör, Fikret H.
Published: (2025)
The $g$-good-neighbor diagnosability of product networks under the PMC model
by: Wang, Zhao, et al.
Published: (2025)
by: Wang, Zhao, et al.
Published: (2025)
Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)
by: Bourneuf, Romain, et al.
Published: (2026)
Similar Items
-
Finding happiness by evolutionary algorithms
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025) -
Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025) -
Overcoming Tight Constraints in Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2026) -
An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks
by: Corcoran, Padraig, et al.
Published: (2025) -
A note on hardness of promise hypergraph colouring
by: Wrochna, Marcin
Published: (2022)