Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
1,327
result(s) for
"Cliques"
Sort by:
The good girls
Mackenzie, Ava, Caitlin, Julie, and Parker have done some not-so-perfect things. Even though they all talked about killing rich bully Nolan Hotchkiss, they didn't actually go through with it. It's just a coincidence that Nolan died in exactly the way they planned... right? Except Nolan wasn't the only one they fantasized about killing. When someone else they named dies, the girls wonder if they're being framed. Or are they about to become the killer's next targets?
Book
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the k-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k-trees, suns, planar graphs, doubly chordal graphs, clique perfect graphs, total graphs, split graphs, line graphs, and dually chordal graphs. We give equations to compute the k-clique, minus clique, signed clique, and k-fold clique transversal numbers for suns, and show that the k-clique transversal problem is polynomial-time solvable for graphs whose clique transversal numbers equal their clique independence numbers. We also show the relationship between the signed and generalization clique problems and present NP-completeness results for the considered problems on k-trees with unbounded k, planar graphs, doubly chordal graphs, total graphs, split graphs, line graphs, and dually chordal graphs.
Journal Article
A horse of her own
At summer camp Jane feels like an outsider among the cliquish rich girls who board their horses at Sunny Acres farm, and when the horse she has been riding is sold to another camper, she feels even worse until her teacher asks her to help train a beautiful but skittish new horse, and the experience brings out the best in her.
Book
k-Clique counting on large scale-graphs: a survey
Clique counting is a crucial task in graph mining, as the count of cliques provides different insights across various domains, social and biological network analysis, community detection, recommendation systems, and fraud detection. Counting cliques is algorithmically challenging due to combinatorial explosion, especially for large datasets and larger clique sizes. There are comprehensive surveys and reviews on algorithms for counting subgraphs and triangles (three-clique), but there is a notable lack of reviews addressing k-clique counting algorithms for k > 3. This paper addresses this gap by reviewing clique counting algorithms designed to overcome this challenge. Also, a systematic analysis and comparison of exact and approximation techniques are provided by highlighting their advantages, disadvantages, and suitability for different contexts. It also presents a taxonomy of clique counting methodologies, covering approximate and exact methods and parallelization strategies. The paper aims to enhance understanding of this specific domain and guide future research of k-clique counting in large-scale graphs.
Journal Article
The worst night ever
Wyatt Palmer's just another undersized freshman hoping to fit in at high school, but when his best friend Matt Diaz's pet ferret ends up in the hands of the Bevins, the most popular boys at Coral Cove High, Wyatt and Matt try to get the animal back by attending a party for the cool clique and stumble onto the Bevin family's dark secret.
Book
Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity
This paper explores the computational challenges of clique transversal problems in d-degenerate graphs, which are commonly encountered across theoretical computer science and various network applications. We examine d-degenerate graphs to highlight their utility in representing sparse structures and assess several variations of clique transversal problems, including the b-fold and b-clique transversal problems, focusing on their computational complexities for different graph categories. Our analysis identifies that certain instances of these problems are polynomial-time solvable in specific graph classes, such as 1-degenerate or 2-degenerate graphs. However, for d-degenerate graphs where d≥2, these problems generally escalate to NP-completeness. We also explore the parameterized complexity, pinpointing specific conditions that render these problems fixed-parameter tractable.
Journal Article
Winning
Who ever said being nice would get you to the top? Certainly not Alexandra Miles. She isn't nice, but she's more than skilled at playing the part. She's queen of Spencer High, effortlessly orchestrating the actions of everyone around her, making them bend to her whim without noticing what they are doing. Alexandra's first step to achieving total domination is to become Homecoming Queen--so when peppy, popular Erin Hewett moves to town and seems to have a real shot at the crown, Alexandra has to take action. With the help of her trusted friend Sam, she decides to introduce a third competitor into the mix--one no one saw coming, one whose meteoric rise and devastating fall will destroy Erin's chances once and for all. Alexandra can run a scheme like this in her sleep. What could possibly go wrong?
Book
Clique Hierarchy Moderates the Association between Social Preference and Defending Behaviors in Early Adolescence: The Role of Gender Differences
Although social preference promotes adolescents’ defending behaviors, its potential mechanisms across gender cliques remain unclear from the group dynamic perspective. This study investigated 2470 Chinese early adolescents (49% girls, Mage = 14.40, SD = 0.58) to explore how social preference and clique hierarchy are associated with defending behaviors and whether these associations differ across gender-specific cliques. The results revealed that social preference was positively related to defending behaviors in boys’ cliques, but negatively in girls’ cliques. Furthermore, the association was strengthened by hierarchization in boys’ cliques but was weakened in girls’ cliques, while the status structure strengthened the association in boys’ but not girls’ cliques. These findings hold crucial implications for understanding and promoting defending behaviors among adolescents.
Journal Article
Pretty in Punxsutawney
Stuck repeating her first day at a new school over and over, seventeen-year-old Andie is convinced that a miracle kiss will break the Sisyphean curse, but she instead discovers how a high school filled with cliques and misfits can find common ground despite their differences.
Book
Non-canonical maximum cliques without a design structure in the block graphs of 2-designs
In this note we answer positively a question of Chris Godsil and Karen Meagher on the existence of a 2-design whose block graph has a non-canonical maximum clique without a design structure.
Journal Article