Copertina

Agglomeration based influential node ranking in path-type networks

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Berberler, Zeynep Nihan, Kunt, Aysun Asena
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Paired Disjunctive Domination Number of Middle Graphs
di: Golpek, Hande Tuncel, et al.
Pubblicazione: (2025)

Spaces of ranked tree-child networks
di: Moulton, Vincent, et al.
Pubblicazione: (2024)

Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank
di: Parnas, Michal
Pubblicazione: (2026)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2025)

All Graphs with at most 8 nodes are 2-interval-PCGs
di: Calamoneri, Tiziana, et al.
Pubblicazione: (2022)

Extended formulations for induced tree and path polytopes of chordal graphs
di: Dupont-Bouillard, Alexandre
Pubblicazione: (2025)

On approximating the rank of graph divisors
di: Bérczi, Kristóf, et al.
Pubblicazione: (2022)

Grand zigzag knight's paths
di: Baril, Jean-Luc, et al.
Pubblicazione: (2024)

Alternative paths computation for congestion mitigation in segment-routing networks
di: Martin, Sébastien, et al.
Pubblicazione: (2024)

Modeling energy collection with shortest paths in rectangular grids: an efficient algorithm for energy harvesting
di: Díaz-Bañez, José-Miguel, et al.
Pubblicazione: (2025)

On graphs coverable by chubby shortest paths
di: Hatzel, Meike, et al.
Pubblicazione: (2025)

Ramsey Goodness of paths and unbalanced graphs
di: Botler, Fábio, et al.
Pubblicazione: (2024)

The Avoider-Enforcer game on hypergraphs of rank 3
di: Galliot, Florian, et al.
Pubblicazione: (2025)

Bipartite Turán number of paths and other trees
di: Bonamy, Marthe, et al.
Pubblicazione: (2025)

Orthogonality between acyclic subdigraphs and paths in digraphs
di: Silva, Caroline A. de Paula, et al.
Pubblicazione: (2026)

Unavoidable butterfly minors in digraphs of large cycle rank
di: Hatzel, Meike, et al.
Pubblicazione: (2025)

Long induced paths and forbidden patterns: Polylogarithmic bounds
di: Duron, Julien, et al.
Pubblicazione: (2024)

A lattice on Dyck paths close to the Tamari lattice
di: Baril, Jean-Luc, et al.
Pubblicazione: (2023)

Tight bound on treedepth in terms of pathwidth and longest path
di: Hatzel, Meike, et al.
Pubblicazione: (2023)

Trapping and commutative Boolean networks
di: Gadouleau, Maximilien
Pubblicazione: (2026)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
di: Galliot, Florian, et al.
Pubblicazione: (2022)

Long induced paths in sparse graphs and graphs with forbidden patterns
di: Duron, Julien, et al.
Pubblicazione: (2024)

Non-empty intersection of longest paths in $H$-free graphs
di: Long Jr., James A., et al.
Pubblicazione: (2023)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
di: Chekan, Vera, et al.
Pubblicazione: (2024)

The formula for the completion time of project networks
di: Castejón-Limas, Manuel, et al.
Pubblicazione: (2024)

Contribution to Blocker and Interdiction optimization problems in networks
di: Martin, Sébastien
Pubblicazione: (2024)

Phenotype control and elimination of variables in Boolean networks
di: Tonello, Elisa, et al.
Pubblicazione: (2024)

Soft happy colourings and community structure of networks
di: Shekarriz, Mohammad H., et al.
Pubblicazione: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
di: de Lima, Paloma T., et al.
Pubblicazione: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
di: Couëtoux, Basile, et al.
Pubblicazione: (2025)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
di: Bérczi, Kristóf, et al.
Pubblicazione: (2025)

Planar induced paths via a decomposition into non-crossing ordered graphs
di: Duron, Julien, et al.
Pubblicazione: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
di: Baste, Julien, et al.
Pubblicazione: (2025)

Creation of fixed points in block-parallel Boolean automata networks
di: Perrot, Kévin, et al.
Pubblicazione: (2025)

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
di: Schwieger, Robert, et al.
Pubblicazione: (2023)

A Boolean encoding of the Most Permissive semantics for Boolean networks
di: de Chancel, Laure, et al.
Pubblicazione: (2026)

Majority Boolean networks classifying density: structural characterization and complexity
di: Perrot, Kévin, et al.
Pubblicazione: (2026)

Approximation algorithms for job scheduling with block-type conflict graphs
di: Furmańczyk, Hanna, et al.
Pubblicazione: (2022)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
di: Jedličková, Nikola, et al.
Pubblicazione: (2023)