Imagen de Portada

The formula for the completion time of project networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Castejón-Limas, Manuel, Martínez, Gabriel Medina, del Castillo, Virginia Riego, Fernández-Robles, Laura
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Broadcast Graph Is NP-complete
por: Xu, Jinghan, et al.
Publicado: (2024)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
por: Dirks, Jona, et al.
Publicado: (2025)

Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels
por: Bourgeais, Quentin, et al.
Publicado: (2025)

An almost complete $t$-intersection theorem for permutations
por: Kupavskii, Andrey
Publicado: (2024)

Faces in rectilinear drawings of complete graphs
por: Balko, Martin, et al.
Publicado: (2025)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2024)

A complete $t$-intersection theorem for families of spanning trees
por: Iarovikova, Elizaveta, et al.
Publicado: (2025)

Trapping and commutative Boolean networks
por: Gadouleau, Maximilien
Publicado: (2026)

tinygarden -- A java package for testing properties of spanning trees
por: Dubinsky, Manuel, et al.
Publicado: (2024)

Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2021)

Three aspects of the MSTCI problem
por: Dubinsky, Manuel, et al.
Publicado: (2023)

p-complete square-free Word-representation of Word-representable Graphs
por: Das, Biswajit, et al.
Publicado: (2025)

CAZAC sequence generation of any length with iterative projection onto unit circle: principle and first results
por: Amis, Karine, et al.
Publicado: (2025)

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

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

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

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
por: Kupavskii, Andrey, et al.
Publicado: (2025)

The PPP-completeness of the Ward-Szabo theorem
por: Ishizuka, Takashi
Publicado: (2025)

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

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

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

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

Agglomeration based influential node ranking in path-type networks
por: Berberler, Zeynep Nihan, et al.
Publicado: (2025)

The complete edge relaxation for binary polynomial optimization
por: Del Pia, Alberto, et al.
Publicado: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
por: Liu, Bowie, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Fast solutions to k-parity and k-synchronisation using parallel automata networks
por: Perrotin, Pacôme, et al.
Publicado: (2024)

Two-stage Stochastic Assignment Games
por: Sanità, Laura, et al.
Publicado: (2025)

Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
por: Espinoza, Alonso, et al.
Publicado: (2025)

Atropos-k is PSPACE-complete
por: Yang, Chao, et al.
Publicado: (2024)

Space-time reversible graph rewriting
por: Arrighi, Pablo, et al.
Publicado: (2025)

Asynchronous dynamics of isomorphic Boolean networks
por: Bridoux, Florian, et al.
Publicado: (2024)

A statistical test for network similarity
por: Miasnikof, Pierre, et al.
Publicado: (2025)

Strong modules and asynchronous attractors of Boolean networks
por: Ruet, Paul
Publicado: (2026)

A recursive linear time modular decomposition algorithm via LexBFS
por: Corneil, Derek, et al.
Publicado: (2007)

Temporal Orienteering with Changing Fuel Costs
por: Corsini, Timothée, et al.
Publicado: (2025)

Interaction graphs of isomorphic automata networks II: universal dynamics
por: Bridoux, Florian, et al.
Publicado: (2024)

The $g$-good-neighbor diagnosability of product networks under the PMC model
por: Wang, Zhao, et al.
Publicado: (2025)

Maker-Maker games of rank 4 are PSPACE-complete
por: Galliot, Florian, et al.
Publicado: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)