Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Thomas Pontoizeau"'
Publikováno v:
Bazgan, C, Chlebikova, J, Dallard, C & Pontoizeau, T 2019, ' Proportionally dense subgraph of maximum size: complexity and approximation ', Discrete Applied Mathematics, vol. 270, pp. 25-36 . https://doi.org/10.1016/j.dam.2019.07.010
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2019, 270, ⟨10.1016/j.dam.2019.07.010⟩
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2019, 270, ⟨10.1016/j.dam.2019.07.010⟩
We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of finding a PDS
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030937355
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8434fa9bd21db8f48ba377692913ddf5
https://doi.org/10.1007/978-3-030-93736-2_18
https://doi.org/10.1007/978-3-030-93736-2_18
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 769, ⟨10.1016/j.tcs.2018.10.011⟩
Theoretical Computer Science, Elsevier, 2019, 769, ⟨10.1016/j.tcs.2018.10.011⟩
An independent 2-clique of a graph is a subset of vertices that is an independent set and such that any two vertices inside have a common neighbor outside. In this paper, we study the complexity of finding an independent 2-clique of maximum size in s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54d6d58f9636f61643ae635c71e9e17b
https://hal.archives-ouvertes.fr/hal-02408822/document
https://hal.archives-ouvertes.fr/hal-02408822/document
Publikováno v:
Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC 2017)
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
LNCS, volume 10236; International audience; An independent 2-clique of a graph is a subset of vertices that is an independent set and such that any two vertices inside have a common neighbor outside. In this paper, we study the complexity of finding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90554a0c3bb87082a786a25205b4489e
https://hal.archives-ouvertes.fr/hal-01512641
https://hal.archives-ouvertes.fr/hal-01512641
Publikováno v:
Bazgan, C, Chlebikova, J & Pontoizeau, T 2015, New insight into 2-community structures in graphs with applications in social networks . in Z Lu, D Kim, W Wu, W Li & D-Z Du (eds), Combinatorial Optimization and Applications : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings . Lecture Notes in Computer Science, vol. 9486, Springer, pp. 236-250, The 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2015), Houston, United States, 18/12/15 . https://doi.org/10.1007/978-3-319-26626-8_18
Combinatorial Optimization and Applications
9th International Conference, COCOA 2015
9th International Conference, COCOA 2015, Dec 2015, Houston, TX, United States. pp.236-250, ⟨10.1007/978-3-319-26626-8_18⟩
Combinatorial Optimization and Applications ISBN: 9783319266251
COCOA
Combinatorial Optimization and Applications
9th International Conference, COCOA 2015
9th International Conference, COCOA 2015, Dec 2015, Houston, TX, United States. pp.236-250, ⟨10.1007/978-3-319-26626-8_18⟩
Combinatorial Optimization and Applications ISBN: 9783319266251
COCOA
We investigate the structural and algorithmic properties of 2-community structure in graphs introduced by Olsen [A general view on computing communities, Mathematical Social Sciences 66(3):331--336, 2013]. A 2-community structure is a partition of ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c2d029b457c1661cdfccebd5b5f056c
https://researchportal.port.ac.uk/portal/en/publications/new-insight-into-2community-structures-in-graphs-with-applications-in-social-networks(46b51dc6-b06e-46ac-ab3d-2e55313165ef).html
https://researchportal.port.ac.uk/portal/en/publications/new-insight-into-2community-structures-in-graphs-with-applications-in-social-networks(46b51dc6-b06e-46ac-ab3d-2e55313165ef).html
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2018, 80 (6), pp.1890-1908. ⟨10.1007/s00453-017-0283-7⟩
Chlebikova, J, Bazgan, C & Pontoizeau, T 2018, ' Structural and algorithmic properties of 2-community structures ', Algorithmica, vol. 80, no. 6, pp. 1890-1908 . https://doi.org/10.1007/s00453-017-0283-7
Algorithmica, Springer Verlag, 2018, 80 (6), pp.1890-1908. ⟨10.1007/s00453-017-0283-7⟩
Chlebikova, J, Bazgan, C & Pontoizeau, T 2018, ' Structural and algorithmic properties of 2-community structures ', Algorithmica, vol. 80, no. 6, pp. 1890-1908 . https://doi.org/10.1007/s00453-017-0283-7
International audience; We investigate the structural and algorithmic properties of 2-community structures in graphs introduced recently by Olsen (Math Soc Sci 66(3):331–336, 2013). A 2-community structure is a partition of a vertex set into two pa